Efficient algorithms for the max $$k$$ -vertex cover problem

Federico Della Croce () and Vangelis Th. Paschos ()
Additional contact information
Federico Della Croce: D.A.I., Politecnico di Torino
Vangelis Th. Paschos: Université Paris-Dauphine

Journal of Combinatorial Optimization, 2014, vol. 28, issue 3, No 13, 674-691

Abstract: Abstract Given a graph $$G(V,E)$$ of order $$n$$ and a constant $$k \leqslant n$$ , the max $$k$$ -vertex cover problem consists of determining $$k$$ vertices that cover the maximum number of edges in $$G$$ . In its (standard) parameterized version, max $$k$$ -vertex cover can be stated as follows: “given $$G,$$ $$k$$ and parameter $$\ell ,$$ does $$G$$ contain $$k$$ vertices that cover at least $$\ell $$ edges?”. We first devise moderately exponential exact algorithms for max $$k$$ -vertex cover, with time-complexity exponential in $$n$$ but with polynomial space-complexity by developing a branch and reduce method based upon the measure-and-conquer technique. We then prove that, there exists an exact algorithm for max $$k$$ -vertex cover with complexity bounded above by the maximum among $$c^k$$ and $$\gamma ^{\tau },$$ for some $$\gamma

Keywords: Maximum $$k$$ -vertex problem; Exact exponential algorithms; Measure-and-conquer (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9575-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9575-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9575-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().