Chain-constrained spanning trees (Q1702777): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-017-1126-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A generalization of permanent inequalities and applications in counting and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalizations of network design problems with degree bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Guarantees for Degree-Bounded Directed Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs / 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: Approximation algorithms for degree-constrained minimum-cost network-design problems / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum bounded degree spanning trees to within one of optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743495 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-017-1126-7 / rank
 
Normal rank

Latest revision as of 04:55, 11 December 2024

scientific article
Language Label Description Also known as
English
Chain-constrained spanning trees
scientific article

    Statements

    Chain-constrained spanning trees (English)
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    network design
    0 references
    spanning trees
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references