The multi-weighted spanning tree problem

DOI10.1007/bfb0030828zbMath1527.68161MaRDI QIDQ6085702

Jeffrey S. Salowe, Joseph L. Ganley, Mordecai J. Golin

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hierarchical network design problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Reducing the hierarchical network design problem
• Parametric shortest path algorithms with an application to cyclic staffing
• The multi-weighted Steiner tree problem
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• An Optimal-Time Algorithm for Slope Selection
• Combinatorial Optimization with Rational Objective Functions
• Minimal ratio spanning trees
• Many birds with one stone

This page was built for publication: The multi-weighted spanning tree problem