Exact algorithms for finding constrained minimum spanning trees (Q2082219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-hop spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank

Revision as of 06:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for finding constrained minimum spanning trees
scientific article

    Statements

    Identifiers