Randomized metarounding
Conference
·
OSTI ID:751128
- Sandia National Laboratories
The authors present a new technique for the design of approximation algorithms that can be viewed as a generalization of randomized rounding. They derive new or improved approximation guarantees for a class of generalized congestion problems such as multicast congestion, multiple TSP etc. Their main mathematical tool is a structural decomposition theorem related to the integrality gap of a relaxation.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 751128
- Report Number(s):
- SAND2000-0281C
- Country of Publication:
- United States
- Language:
- English
Similar Records
Towards a 4/3 Approximation for the Asymmetric Traveling Salesman Problem
Multicriteria approximation through decomposition
Multicriteria approximation through decomposition
Conference
·
Thu Jun 10 00:00:00 EDT 1999
·
OSTI ID:7891
Multicriteria approximation through decomposition
Conference
·
Mon Jun 01 00:00:00 EDT 1998
·
OSTI ID:672075
Multicriteria approximation through decomposition
Conference
·
Sun Nov 30 23:00:00 EST 1997
·
OSTI ID:642754