Approximation algorithms via contraction decomposition (Q1945289): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3136485547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating and nonseparating disjoint homotopic cycles in graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Parameters and Local Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subset spanner for Planar graphs, with application to subset TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Local Planarity and the Width of Graph Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XI: Circuits on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: All structured programs have small tree width and good register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank

Latest revision as of 08:49, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms via contraction decomposition
scientific article

    Statements

    Approximation algorithms via contraction decomposition (English)
    0 references
    0 references
    0 references
    5 April 2013
    0 references
    graphs of bounded (Euler) genus
    0 references
    contracting edges
    0 references
    graphs of bounded treewidth
    0 references
    obtaining PTASs for contraction-closed problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers