The following pages link to Are Stable Instances Easy? (Q2911066):
Displaying 20 items.
- Center-based clustering under perturbation stability (Q763489) (← links)
- Robust optimization in the presence of uncertainty: a generic approach (Q1745727) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- Preclustering algorithms for imprecise points (Q2144264) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- On semi-supervised active clustering of stable instances with oracles (Q2274518) (← links)
- Good (K-means) clusterings are unique (up to small perturbations) (Q2274925) (← links)
- Perturbation resilience for the facility location problem (Q2417105) (← links)
- Pareto robust optimization on Euclidean vector spaces (Q2693797) (← links)
- Finding Meaningful Cluster Structure Amidst Background Noise (Q2831395) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- (Q5009501) (← links)
- (Q5075740) (← links)
- (Q5091167) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
- (Q6062155) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
