On efficient fixed-parameter algorithms for weighted vertex cover☆
References (32)
- et al.
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Math.
(2001) - et al.
An improved fixed parameter algorithm for vertex cover
Inform. Process. Lett.
(1998) - et al.
A linear-time approximation algorithm for the Weighted Vertex Cover problem
J. Algorithms
(1981) - et al.
Vertex cover: Further observations and further improvements
J. Algorithms
(2001) - et al.
An efficient exact algorithm for constraint bipartite vertex cover
J. Algorithms
(2001) New methods for 3-SAT decision and worst-case analysis
Theoret. Comput. Sci.
(1999)- et al.
A general method to speed up fixed-parameter-tractable algorithms
Inform. Process. Lett.
(2000) Algorithms for maximum independent sets
J. Algorithms
(1986)- et al.
Efficient data reduction for dominating set: a linear problem kernel for the planar case
- et al.
Graph separators: a parameterized view
Parameterized complexity: exponential speed-up for planar graph problems
Complexity and Approximation—Combinatorial Optimization Problems and their Approximability Properties
(1999)
A local-ratio theorem for approximating the Weighted Vertex Cover problem
Ann. Discrete Math.
(1985)
Nondeterminism within P
SIAM J. Comput.
(1993)
How to find the best approximation results—a follow-up to Garey and Johnson
ACM SIGACT News
(1998)
Cited by (102)
EFFECTIVENESS OF THE MINEREDUCE APPROACH IN REDUCING THE SIZE OF COMBINATORIAL OPTIMIZATION PROBLEM INSTANCES
2024, RAIRO - Operations ResearchFrom Minimum Change to Maximum Density: On Determining Near-Optimal S-Repair
2024, IEEE Transactions on Knowledge and Data EngineeringParameterized Approximation Algorithms for Weighted Vertex Cover
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Approximate Monotone Local Search for Weighted Problems
2023, Leibniz International Proceedings in Informatics, LIPIcsRound and Bipartize for Vertex Cover Approximation
2023, Leibniz International Proceedings in Informatics, LIPIcs
- ☆
A preliminary version of this paper was presented at the 11th Annual International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Comput. Sci., Springer-Verlag, 1969, pp. 180–191, held in Taipei, Taiwan, December 2000. This conference version, however, contains a faulty application of the main result to the case of minimum weight vertex covers with a bound on the number of vertices.
- 1
Work performed within the PEAL project (parameterized complexity and exact algorithms), supported by the Deutsche Forschungsgemeinschaft (NI-369/1).
Copyright © 2003 Elsevier Science (USA). All rights reserved.