Reoptimization of maximum weight induced hereditary subgraph problems
From MaRDI portal
Recommendations
- Reoptimization of some maximum weight induced hereditary subgraph problems
- Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
- On-line computation and maximum-weighted hereditary subgraph problems
- Algorithms and Computation
- Reoptimization of Weighted Graph and Covering Problems
- On-line maximum-order induced hereditary subgraph problems
- scientific article; zbMATH DE number 2079869
- Algorithms for the maximum weight connected \(k\)-induced subgraph problem
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Cites work
- scientific article; zbMATH DE number 5859273 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- A data structure for dynamic trees
- Approximating Maximum Clique by Removing Subgraphs
- Approximating maximum independent sets by excluding subgraphs
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast reoptimization for the minimum spanning tree problem
- Graph minors. XX: Wagner's conjecture
- Knowing all optimal solutions does not help for TSP reoptimization
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maintaining minimum spanning trees in dynamic graphs
- New reoptimization techniques applied to Steiner tree problem
- On finite affine line transitive planes
- On the Hardness of Reoptimization
- On the Hardness of Reoptimization with Multiple Given Solutions
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Reoptimization of Steiner Trees
- Reoptimization of Steiner trees: changing the terminal set
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
- Reoptimization of Weighted Graph and Covering Problems
- 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
- Simple and fast reoptimizations for the Steiner tree problem
- The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)
- The approximation of maximum subgraph problems
Cited in
(12)- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- New algorithms for Steiner tree reoptimization
- Robust reoptimization of Steiner trees
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- A survey on combinatorial optimization in dynamic environments
- A note on the traveling salesman reoptimization problem under vertex insertion
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
- Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
- Reoptimization of some maximum weight induced hereditary subgraph problems
- Reoptimization of Weighted Graph and Covering Problems
- New algorithms for Steiner tree reoptimization
This page was built for publication: Reoptimization of maximum weight induced hereditary subgraph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386899)
