 | Heinrich Begehr, Helmut Koch, Jürg Kramer, Norbert Schappacher, Ernst-Jochen Thiele - 1998 - 1840 Seiten
...hypergraphs. In Proc. Eleventh ACM-SIAM Symposium on Discrete Algorithms, January 2000, pages 329-337. 18. DS Hochbaum. Approximation algorithms for the set covering and vertex cover problems. WP#64- 79-80, GSIA, Carnegie-Mellon University, April 1980. Also: SIAM J. Comput. 11(3) 1982. 19. DS... | |
 | Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack - 2005 - 457 Seiten
...problem. In Proceedings of the 11th Annual European Symposium on Algorithms, pages 289-300, 2003. [8] DS Hochbaum. Approximation algorithms for the set...problems. SIAM Journal on Computing, 11:555-556, 1982. [9] DP Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series... | |
 | Sotiris Nikoletseas - 2005 - 637 Seiten
...multi-radius cover problem, 2004. 8. R. Hassin and D. Segev. The set cover with pairs problem, 2005. 9. DS Hochbaum. Approximation algorithms for the set...vertex cover problems. SIAM Journal on Computing, 1 1 :555-556, 1982. 10. DS Hochbaum. Instant recognition of half integrality and 2-approximations.... | |
 | Takeshi Tokuyama - 2007 - 945 Seiten
...Slater, PJ: Domination in Graphs: The Theory. Marcel Dekker, Inc., New York (1998) 11. Hochbaum, DS: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555-556 (1982) 12. Ibarra, OH, Kim, CE: Fast approximation algorithms for the knapsack and sum... | |
 | Christos Kaklamanis, Martin Skutella - 2008 - 297 Seiten
...the set-covering problem. Mathematics of Operations Research 4(3), 233-235 (1979) 4. Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555-556 (1982) 5. Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted... | |
| |
DS Hochbaum. Approximation Algorithms for the Set Covering and Vertex Cover Problems. 