Parameterized algorithms for minimum sum vertex cover

DOI10.1007/978-3-031-55601-2_13MaRDI QIDQ6547957

Fahad Panolan, Shubhada Aute

Publication date: 31 May 2024

zbMATH Keywords

vertex coverFPTinteger quadratic programming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Hardness results for approximating the bandwidth
• Improved upper bounds for vertex cover
• On optimal linear arrangements of trees
• Parameterized algorithmics for linear arrangement problems
• The NP-completeness of the bandwidth minimization problem
• On chromatic sums and distributed resource allocation
• Approximating min sum set cover
• The linear arrangement problem parameterized above guaranteed value
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• A projected gradient algorithm for solving the maxcut SDP relaxation
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
• Graph Layout Problems Parameterized by Vertex Cover
• Topological Bandwidth
• A polynomial algorithm for the min-cut linear arrangement of trees
• Complexity Results for Bandwidth Minimization
• Reducibility among Combinatorial Problems
• Parameterized Complexity of Bandwidth on Trees
• Cutwidth I: A linear time fixed parameter algorithm
• Optimal Assignments of Numbers to Vertices
• Some results on approximability of minimum sum vertex cover

This page was built for publication: Parameterized algorithms for minimum sum vertex cover