Reoptimization under vertex insertion: max P_k-free subgraph and max planar subgraph
From MaRDI portal
Publication:2846477
Recommendations
- Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
- 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
Cites work
- Fast reoptimization for the minimum spanning tree problem
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 1021588 (Why is no real title available?)
- New reoptimization techniques applied to Steiner tree problem
- On finite affine line transitive planes
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Reoptimization of Steiner trees: changing the terminal set
- Reoptimization of the metric deadline TSP
- Reoptimization of the shortest common superstring problem
- Reoptimizing the 0-1 knapsack problem
- Reoptimizing the traveling salesman problem
- Scheduling with forbidden sets
Cited in
(6)- Reoptimization of Path Vertex Cover problem
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
- Reoptimization of some maximum weight induced hereditary subgraph problems
- New algorithms for Steiner tree reoptimization
- New algorithms for Steiner tree reoptimization
This page was built for publication: Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846477)
