scientific article; zbMATH DE number 1512690
From MaRDI portal
Publication:4508378
Recommendations
- Minimum spanning hypertrees
- Minimum spanning trees in d dimensions
- scientific article; zbMATH DE number 1436136
- On generalized minimum spanning trees
- Minimum spanning trees
- Minimum Spanning Trees in k-Dimensional Space
- Minimum Diameter Spanning Trees and Related Problems
- Minimal spanning trees
- Minimum spanning trees made easier via multi-objective optimization
Cited in
(15)- Geometric lower bounds for parametric matroid optimization
- Decomposable multi-parameter matroid optimization problems.
- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
- Finding the shortest bottleneck edge in a parametric minimum spanning tree
- scientific article; zbMATH DE number 1002204 (Why is no real title available?)
- scientific article; zbMATH DE number 1263243 (Why is no real title available?)
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Using sparsification for parametric minimum spanning tree problems
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Minimax parametric optimization problems and multi-dimensional parametric searching
- Notes on computing peaks in k-levels and parametric spanning trees
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Minimum spanning trees made easier via multi-objective optimization
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 Q4508378)
