Amortized efficiency of list update and paging rules
Communications of the ACM
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Improved performance of the greedy algorithm for partial cover
Information Processing Letters
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Using homogenous weights for approximating the partial cover problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing small partial coverings
Information Processing Letters
SIAM Journal on Computing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for a hierarchically structured bin packing problem
Information Processing Letters
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
SIAM Journal on Computing
Incremental Medians via Online Bidding
Algorithmica
LP Rounding Approximation Algorithms for Stochastic Network Design
Mathematics of Operations Research
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
An experimental evaluation of incremental and hierarchical k-median algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing knapsack solutions with cardinality robustness
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Hi-index | 0.00 |
We present a general framework and algorithmic approach for incremental approximation algorithms. The framework handles cardinality constrained minimization problems, such as the $k$-median and $k$-MST problems. Given some notion of ordering on solutions of different cardinalities $k$, we give solutions for all values of $k$ such that the solutions respect the ordering and such that for any $k$, our solution is close in value to the value of an optimal solution of cardinality $k$. For instance, for the $k$-median problem, the notion of ordering is set inclusion, and our incremental algorithm produces solutions such that for any $k$ and $k'$, $kSIAM J. Comput., 32 (2003), pp. 816-832]) and incremental versions of the $k$-MST problem, $k$-vertex cover problem, $k$-set cover problem, as well as the uncapacitated facility location problem (which is not cardinality-constrained). For these problems we get either new incremental algorithms or improvements over what was previously known. We also show that the framework applies to hierarchical clustering problems. In particular, we give an improved algorithm for a hierarchical version of the $k$-median problem introduced by Plaxton [C. G. Plaxton, J. Comput. System Sci., 72 (2006), pp. 425-443].