Randomized metarounding (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 58-62

  Carr, Robert ^a   Vempala, Santosh ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

integrality gap; polyhedra; randomized rounding

Indexed keywords

CONVEX COMBINATIONS; EXTENDED ABSTRACTS; FRACTIONAL SOLUTIONS; INTEGER SOLUTIONS; INTEGRALITY GAPS; LINEAR RELAXATIONS; POLYHEDRA; RANDOMIZED ROUNDING;

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; HEURISTIC METHODS; RANDOM PROCESSES; THEOREM PROVING;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

INTEGRALITY GAP; POLY-TIME HEURISTICS; POLYHEDRA; RANDOMIZED METAROUNDING;

EID: 0033702354     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335312     Document Type: Conference Paper

References (6)

1. R. Carr and S. Vempala. Towards a 4/3 approximation for the asymmetric traveling salesman problem. In SODA Conference Proceedings, 2000.
2. J. Cheriyan, A. Sebo, and Z.Szigeti. Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph. In IPCO Conference Proceedings, 1998.
3. T. Hagerup and C. Rub. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305-308, 1990.
4. P. Raghavan and C. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
5. P. Raghavan and C. Thompson. Multiterminal global routing: a deterministic approximation scheme. Algorithmica, 6:73-82, 1991.
6. S. Vempala and B. Voecking. Approximating multicast congestion. In ISAAC Proceedings, 1999.