Faster Parameterized Algorithms Using Linear Programming
Work
Year: 2014
Type: article
Abstract: We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxation of the prob... more
Source: ACM Transactions on Algorithms
Institutions University of California, San Diego, Indian Institute of Technology Madras, Institute of Mathematical Sciences
Cites: 30
Cited by: 179
Related to: 10
FWCI: 14.52
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green