Approximation of minimum weight spanners for sparse graphs (Q627187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60488549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / 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: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay graphs are almost as good as complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the sparsest 2-spanner of 4-connected planar triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-spanner problems for \(k>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886099 / 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: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Distortion Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 19:45, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximation of minimum weight spanners for sparse graphs
scientific article

    Statements

    Approximation of minimum weight spanners for sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2011
    0 references
    graph algorithms
    0 references
    graph spanners
    0 references
    sparsest \(t\)-spanner
    0 references
    EPTAS
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers