The multi-weighted spanning tree problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 437549 (Why is no real title available?)
- scientific article; zbMATH DE number 3717343 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256677 (Why is no real title available?)
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- An Optimal-Time Algorithm for Slope Selection
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Many birds with one stone
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Minimal ratio spanning trees
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
- Parametric shortest path algorithms with an application to cyclic staffing
- Reducing the hierarchical network design problem
- The hierarchical network design problem
- The multi-weighted Steiner tree problem
Cited in
(2)
This page was built for publication: The multi-weighted spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085702)