Primal-dual approximation algorithms for a packing-covering pair of problems

RAIRO - Operations Research

Volumn 36, Issue 1, 2002, Pages 53-71

  Kovaleva, Sofia ^a   Spieksma, Frits C R ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Approximation algorithms; Intervals; Packing covering; Primal dual

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; VECTORS;

APPROXIMATION ALGORITHMS; PACKING PROBLEM; POLYNOMIAL TIME;

ALGORITHMS;

EID: 0036372408     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2002005     Document Type: Article

References (15)

1. J. Aerts and E.J. Marinissen, Scan chain design for test time reduction in core-based ICs, in Proc. of the International Test Conference. Washington DC (1998).
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in Proc. of the 33rd IEEE Symposium on the Foundations of Computer Science (1992) 14-23.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti Spaccamela and M. Protasi, Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer Verlag, Berlin (1999).
4. A. Bar-Noy, S. Guha, J. Naor and B. Schieber, Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. 31 (2001) 331-352.
5. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, A Unified Approach to Approximating Resource Allocation and Scheduling. J. ACM 48 (2001) 1069-1090.
6. P. Berman and B. DasGupta, Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Combin. Optim. 4 (2000) 307-323.
7. T. Erlebach and F.C.R. Spieksma, Simple algorithms for a weighted interval selection problem, in Proc. of the 11th Annual International Symposium on Algorithms and Computation (ISAAC '00). Lecture Notes in Comput. Sci. 1969 (2000) 228-240 (see also Report M00-01, Maastricht University).
8. N. Garg, V.V. Vazirani and M. Yannakakis, Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica 18 (1997) 3-20.
9. M.X. Goemans and D.P. Williamson, The primal-dual method for approximation algorithms and its application to network design problems, Chap. 4 of Approximation algorithms for NP-hard problems, edited by D.S. Hochbaum. PWC Publishing Company, Boston (1997).
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, San Diego, California (1980).
11. D.S. Hochbaum, Approximation algorithms for NP-hard problems. PWC Publishing Company, Boston (1997).
12. D.S. Hochbaum, Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set and Related Problems, Chap. 3 of Approximation algorithms for NP-hard problems, edited by D.S. Hochbaum. PWC Publishing Company, Boston (1997).
13. C.H. Papadimitriou, Computational Complexity. Addison-Wesley, Reading, Massachussets (1994).
14. F.C.R. Spieksma, On the approximability of an interval scheduling problem. J. Schedul. 2 (1999) 215-227.
15. D.P. Williamson, Course notes Primal-Dual methods, available at http://www.research.ibm.com/people/w/williamson/#Notes