Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Partial vertex cover (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002-2009 (9)
Publication types (Num. hits)
article(3) inproceedings(6)
Venues (Conferences, Journals, ...)
Algorithmica(1) APPROX(1) APPROX-RANDOM(1) IWPEC(1) J. Comb. Optim.(1) SODA(1) Theory Comput. Syst.(1) WADS(1) WG(1)
Authors
Jiong Guo(2) Julián Mestre(2) Rolf Niedermeier(2) Sebastian Wernicke(2) Alexander Langer(1) Aravind Srinivasan(1) Eran Halperin(1) Joachim Kneis(1) Özgür Sümer(1) Peter Damaschke(1) Peter Rossmanith(1) Toshihiro Fujito(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 8 keywords
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
3Eran Halperin, Aravind Srinivasan Improved Approximation Algorithms for the Partial Vertex Cover Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
2Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Vertex cover, Primal-dual algorithms
2Joachim Kneis, Alexander Langer, Peter Rossmanith Improved Upper Bounds for Partial Vertex Cover. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Damaschke Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Rolf Niedermeier, Sebastian Wernicke Parameterized Complexity of Vertex Cover Variants. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Özgür Sümer Partial covering of hypergraphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF partial hypergraph cover, partial set cover, greedy algorithm
1Jiong Guo, Rolf Niedermeier, Sebastian Wernicke Parameterized Complexity of Generalized Vertex Cover Problems. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Toshihiro Fujito On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF covering integer program, approximation algorithm, combinatorial optimization, partial cover
Displaying result #1 - #9 of 9 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.