scientific article

From MaRDI portal

Publication:4017161

Jump to:navigation, search

zbMath0756.05061MaRDI QIDQ4017161

N. R. Achuthan, Louis Caccetta

Publication date: 16 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree optimization linear programming diameter branch and bound method spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Linear programming (90C05)

Related Items (5)

Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees ⋮ A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4017161&oldid=17723882"