Reoptimization of Path Vertex Cover problem

DOI10.1007/978-3-030-26176-4_30MaRDI QIDQ2300052zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 February 2020

Full work available at URL https://arxiv.org/abs/1904.10719

zbMATH Keywords

approximation algorithmspath vertex coverreoptimization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• On approximability of connected path vertex cover
• Reoptimization of NP-Hard Problems

Cited in

(1)

• Replica Placement via Capacitated Vertex Cover

This page was built for publication: Reoptimization of Path Vertex Cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300052)