Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Beyond worst case analysis"”.
-
Approximation algorithms for clustering and facility location problems
… in practice, there is an increasing emphasis on beyond worst-case analysis. In this thesis we consider both these approaches. In the first part we design worst case approximation algorithms for Uniform Submodular Facility Location (USFL), and Capacitated k-center (CapKCenter) problems. USFL is a …
-
Optimization Dynamics in Mildly Overparametrized Models
… the underlying mechanisms, allowing us to go beyond worst-case analysis. In this thesis, we aim to understand the training dynamics of such mildly overparametrized models. We leverage natural properties of these problems and provide theoretical analysis of their optimization dynamics.</p><p>In …
-
In pursuit of linear complexity in discrete and computational geometry
… enclosing k points, and many others. In several cases we get the first known linear time approximation algorithm for a given problem, where our approximation ratio matches that of previous work. The second topic we investigate is contour trees, a fundamental structure in computational topology. …
-
Mechanism design, social choice and equilibrium computation in restricted domains
… strong impossibility results by restricting our analysis in “natural” sub-classes of the general instance space (WINE ’21). In this setting we have studied the approximability of the facility location problem by truthful mechanisms, whose allocation is aligned with the agent incentives. (3) …