 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen 
|
Hilfe 
|
 |
|
| Suche: Citkey="Gandhi-Khuller-Srinivasan/01" |
|
Approximation algorithms for partial covering problems
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP'2001 (Crete, Greece, July 8-12, 2001)
Lecture Notes in Computer Science
2076
, 2001, pp. 225-236
| Editors | Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen | |
| Publisher: | Springer-Verlag | |
| Address: | Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo | |
| Keywords: | approximation algorithms, partial covering, set cover, vertex cover, primal-dual methods, randomized rounding | |
| URL: |
http://springerlink.metapress.com/openurl.asp?genre=article&id=RMQCVU3FUC9V0BY0 | |
|
|
|
|