Randomized metarounding

Authors:
Robert Carr;Santosh Vempala
Affiliations:
Sandia National Labs, Albuquerque, New Mexico;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Year:
2002

Citing 4
Cited 20

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
A guided tour of Chernoff bounds

Information Processing Letters
Towards a 4/3 approximation for the asymmetric traveling salesman problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms

Approximation algorithms

Truthful and Near-Optimal Mechanism Design via Linear Programming

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tight approximation algorithms for maximum general assignment problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Playing games with approximation algorithms

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Compacting cuts: a new linear formulation for minimum cut

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Packing element-disjoint steiner trees

ACM Transactions on Algorithms (TALG)
Approximation algorithms for labeling hierarchical taxonomies

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Compacting cuts: A new linear formulation for minimum cut

ACM Transactions on Algorithms (TALG)
Multicast Routing and Design of Sparse Connectors

Algorithmics of Large and Complex Networks
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Disjoint bases in a polymatroid

Random Structures & Algorithms
Approximation algorithms for non-single-minded profit-maximization problems with limited supply

WINE'10 Proceedings of the 6th international conference on Internet and network economics
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP

SIAM Journal on Computing
Design is as Easy as Optimization

SIAM Journal on Discrete Mathematics
Iterative packing for demand and hypergraph matching

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Tight Approximation Algorithms for Maximum Separable Assignment Problems

Mathematics of Operations Research
Truthful and Near-Optimal Mechanism Design via Linear Programming

Journal of the ACM (JACM)
Improved approximation algorithms for Directed Steiner Forest

Journal of Computer and System Sciences
Combinatorial auctions with restricted complements

Proceedings of the 13th ACM Conference on Electronic Commerce
Secondary spectrum auctions for symmetric and submodular bidders

Proceedings of the 13th ACM Conference on Electronic Commerce
A rounding by sampling approach to the minimum size k-arc connected subgraph problem

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P be a linear relaxation of an integer polytope Z such that the integrality gap of P with respect to Z is at most r, as verified by a polytime heuristic A, which on any positive cost function c returns an integer solution (an extreme point of Z) whose cost is at most r times the optimal cost over P. Then for any point x* in P (a fractional solution), rx* dominates some convex combination of extreme points of Z. A constructive version of this theorem is presented here, with applications to approximation algorithms, and can be viewed as a generalization of randomized rounding.