Journal ArticleDOI
Computing small partial coverings
TLDR
The generalization of covering problems such as the set cover problem to partial covering problems, where one only wants to cover a given number k of elements rather than all elements, is studied.About:
This article is published in Information Processing Letters.The article was published on 2003-03-31. It has received 68 citations till now. The article focuses on the topics: Edge cover & Vertex cover.read more
Citations
More filters
Journal ArticleDOI
Survey: Covering problems in facility location: A review
TL;DR: This survey tries to review all aspects of the covering problems by stressing the works after Schilling, Jayaraman, and Barkhi (1993).
Journal ArticleDOI
Parameterized Complexity of Vertex Cover Variants
TL;DR: It is shown that, with the size of the desired vertex cover as the parameter, CONNECTED VERTEX COVER and CAPACITATED VERT EX COVER are both fixed-parameter tractable while MAXIMUM PARTIAL VERTex COVER is W[1]-complete.
Proceedings ArticleDOI
Campaigns for lazy voters: truncated ballots
TL;DR: In this paper, the authors study elections in which voters may submit partial ballots consisting of truncated lists: each voter ranks some of her top candidates and is indifferent among the remaining ones.
Journal ArticleDOI
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles
Venkatesh Raman,Saket Saurabh +1 more
TL;DR: It is shown that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles.
Book ChapterDOI
Parameterized complexity of generalized vertex cover problems
TL;DR: Interestingly, although the considered generalized Vertex Cover problems behave very similar in terms of constant-factor approximability, they display a wide range of different characteristics when investigating their parameterized complexities.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Parameterized Complexity
TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Journal ArticleDOI
The complexity of computing the permanent
TL;DR: It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations.
Book
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Giorgio Ausiello,Pierluigi Crescenzi,Giorgio Gambosi,Viggo Kann,Alberto Marchetti-Spaccamela,Marco Protasi +5 more
TL;DR: This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems.