Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
From MaRDI portal
Publication:2889902
DOI10.1007/978-3-642-28076-4_10zbMath1351.68306OpenAlexW1485200564MaRDI QIDQ2889902
Vangelis Th. Paschos, Nicolas Boria, Jérôme Monnot
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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (3)
A survey on combinatorial optimization in dynamic environments ⋮ Reoptimization in machine scheduling ⋮ 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
