Approximation of rectangle stabbing and interval stabbing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 426-435

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

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048887996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_39     Document Type: Article

References (6)

1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin [1993], Network Flows: Theory, Algorithms, and Applications, Prentice-Hall.
2. Gaur, D., T. Ibaraki, and R. Krishnamurti [2002], Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem, Journal of Algorithms 43, 138-152.
3. Hassin, R., and N. Megiddo [1991], Approximation algorithm for hitting objects with straight lines, Discrete Applied Mathematics 30, 29-42.
4. Kovaleva, S. [2003], Approximation of Geometric Set Packing and Hitting Set Problems, Ph.D. thesis of Maastricht University.
5. Kovaleva, S., and F.C.R. Spieksma [2002], Primal-dual approximation algorithms for a packing-covering pair of problems, RAIRO-Operations Research 36, 53-72.
6. Vazirani, V.V. [2001], Approximation Algorithms, Springer.