scientific article; zbMATH DE number 6381654
From MaRDI portal
Publication:2934606
Recommendations
- Approximation algorithms via contraction decomposition
- scientific article; zbMATH DE number 1264429
- scientific article; zbMATH DE number 1330032
- Approximation algorithms
- A decomposition based algorithm for maximal contractions
- On Approximation Algorithms for # P
- Approximation Algorithms for CSPs
- Approximation Algorithms for the Minimum Convex Partition Problem
- An approximate decomposition algorithm for convex minimization
Cited in
(18)- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- On the excluded minor structure theorem for graphs of large tree-width
- Approximation algorithms via contraction decomposition
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- A decomposition based algorithm for maximal contractions
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Spanning closed walks and TSP in 3-connected planar graphs
- Counting and sampling minimum cuts in genus g graphs
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
- scientific article; zbMATH DE number 7053305 (Why is no real title available?)
- Spanning closed walks and TSP in 3-connected planar graphs
- Global minimum cuts in surface embedded graphs
- Minimum Cuts in Surface Graphs
- Exact and approximation algorithms for computing optimal fat decompositions
- Computing the shortest essential cycle
- Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934606)
