Degree-bounded minimum spanning trees (Q1028423): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for degree-restricted MST and red-blue separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean bounded-degree spanning tree ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-bounded minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Degree Spanning Trees of Small Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two geometric problems related to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for degree-constrained minimum-cost network-design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean spanner graphs with degree four / rank
 
Normal rank

Latest revision as of 18:15, 1 July 2024

scientific article
Language Label Description Also known as
English
Degree-bounded minimum spanning trees
scientific article

    Statements

    Degree-bounded minimum spanning trees (English)
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning trees
    0 references
    minimum spanning trees
    0 references
    MST
    0 references
    approximation algorithm
    0 references
    geometric optimization
    0 references
    network design
    0 references
    0 references
    0 references