Contractors' minimum spanning tree

MaRDI QIDQ5197582zbMATH OpenFDO

Authors Ilan Newman, Irith Ben-Arroyo Hartman

Publication date 19 September 2019

Full work available at URL http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p033.pdf

zbMATH Keywords

cardinality cost functions values

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The constrained minimum spanning tree problem
• The color-balanced spanning tree problem.
• Submodular potential function for the minimum color spanning tree problem of edge-colored graphs
• Spanning trees with many or few colors in edge-colored graphs
• On the minimum label spanning tree problem

Cites work

• Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 757675 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Matroid intersection algorithms
• On the shortest spanning subtree of a graph and the traveling salesman problem

Cited in

(6)

• The -connected assignment problem
• Minimum spanning hypertrees
• Submodular potential function for the minimum color spanning tree problem of edge-colored graphs
• scientific article; zbMATH DE number 4156450 (Why is no real title available?)
• The color-balanced spanning tree problem.
• The minimum consistent spanning subset problem on trees

This page was built for publication: Contractors' minimum spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197582)