Network design with weighted degree constraints (Q429670): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114554145 / 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: Survivable Network Design with Degree or Order Constraints / 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: What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs / 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: 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: Many birds with one stone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree 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: Q5302101 / 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: Degree Bounded Matroids and Submodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with minimum weighted degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Directed Weighted-Degree Constrained Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
Network design with weighted degree constraints
scientific article

    Statements

    Network design with weighted degree constraints (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    0 references
    connectivity
    0 references
    degree constraint
    0 references
    iterative rounding
    0 references
    network design
    0 references
    spanning tree
    0 references
    0 references