Reoptimization of Weighted Graph and Covering Problems
From MaRDI portal
Publication:3602840
DOI10.1007/978-3-540-93980-1_16zbMATH Open1209.68632OpenAlexW1508327628MaRDI QIDQ3602840FDOQ3602840
Authors: D. Bilò, Anna Zych, Peter Widmayer 
Publication date: 12 February 2009
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_16
Recommendations
- Reoptimization of maximum weight induced hereditary subgraph problems
- Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- Reoptimization of some maximum weight induced hereditary subgraph problems
- Reoptimization of set covering problems
Cites Work
- Title not available (Why is that?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Title not available (Why is that?)
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- On the Hardness of Reoptimization
- Reoptimizing the traveling salesman problem
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Approximating maximum independent sets by excluding subgraphs
- Reoptimization of Steiner Trees
Cited In (27)
- Reoptimization of the shortest common superstring problem
- Dumbbell graphs with extremal (reverse) cover cost
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- Fast reoptimization for the minimum spanning tree problem
- A survey on combinatorial optimization in dynamic environments
- Optimization problems for weighted graphs and related correlation estimates
- 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
- Reoptimization of set covering problems
- Parameterized dynamic variants of red-blue dominating set
- New algorithms for Steiner tree reoptimization
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
- New reoptimization techniques applied to Steiner tree problem
- Title not available (Why is that?)
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- Some graph optimization problems with weights satisfying linear constraints
- A note on the traveling salesman reoptimization problem under vertex insertion
- Reoptimization in machine scheduling
- Robust reoptimization of Steiner trees
- Reoptimization of NP-Hard Problems
- Reoptimization of the Shortest Common Superstring Problem
- Reoptimization of parameterized problems
- Reoptimization of the metric deadline TSP
- Knowing all optimal solutions does not help for TSP reoptimization
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Reoptimization of maximum weight induced hereditary subgraph problems
This page was built for publication: Reoptimization of Weighted Graph and Covering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602840)
