Reoptimization of the maximum weighted P_k -free subgraph problem under vertex insertion

DOI10.1007/978-3-642-28076-4_10MaRDI QIDQ2889902zbMATH OpenOpenAlexFDO

Authors Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Publication date 8 June 2012

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28076-4_10

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• Reoptimization of some maximum weight induced hereditary subgraph problems
• Reoptimization of maximum weight induced hereditary subgraph problems
• Reoptimization of Weighted Graph and Covering Problems
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

Cited in

(8)

• Reoptimization of Path Vertex Cover problem
• Reoptimization in machine scheduling
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• Reoptimization of some maximum weight induced hereditary subgraph problems
• A survey on combinatorial optimization in dynamic environments
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of maximum weight induced hereditary subgraph problems
• A note on the traveling salesman reoptimization problem under vertex insertion

This page was built for publication: Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion

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