scientific article; zbMATH DE number 1163716

MaRDI QIDQ4395329zbMATH OpenFDO

Authors Narsingh Deo, Nishit Kumar

Publication date 16 December 1998

zbMATH Keywords

approximate algorithmsconstrained-spanning tree problemsparallel implementations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel numerical computation (65Y05) Distributed algorithms (68W15) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1161326
• scientific article; zbMATH DE number 1086911
• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

Cited in

(6)

• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
• Using Lagrangian dual information to generate degree constrained spanning trees
• scientific article; zbMATH DE number 1086911 (Why is no real title available?)
• scientific article; zbMATH DE number 1161326 (Why is no real title available?)
• scientific article; zbMATH DE number 1161335 (Why is no real title available?)
• Approximation of the degree-constrained minimum spanning hierarchies

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication:

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