Approximation algorithms for capacitated rectangle stabbing

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

Volumn 3998 LNCS, Issue , 2006, Pages 18-29

  Even, Guy ^a   Rawitz, Dror ^b   Shahar, Shimon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; NUMERICAL METHODS;

APPROXIMATION ALGORITHMS; CAPACITATED RECTANGLE STABBING; D-DIMENSIONAL RECTANGLE STABBING; SOFT CAPACITIES;

PROBLEM SOLVING;

EID: 33746086322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_5     Document Type: Conference Paper

References (8)

1. Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2 (1982) 385-393
2. Chuzhoy, J., Naor, J.: Covering problems with hard capacities. In; 43nd IEEE Symposium on Foundations of Computer Science. (2002) 481-489
3. Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. Journal of Algorithms 48(1) (2003) 257-270
4. Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms 43 (2002) 138-152
5. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
6. Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30(1) (1991) 29-42
7. Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized submodular cover problems and applications. Theoretical Computer Science 250 (2001) 179-200
8. Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. In: 30th Annual International Colloquium on Automata, Languages and Programming. Volume 2719 of LNCS. (2003) 164-175