A stronger lower bound on parametric minimum spanning trees
From MaRDI portal
Publication:832875
DOI10.1007/978-3-030-83508-8_25OpenAlexW3196452198MaRDI QIDQ832875FDOQ832875
Authors: David Eppstein 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.05371
Recommendations
- A stronger lower bound on parametric minimum spanning trees
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Lower bounds for testing Euclidean minimum spanning trees
- scientific article; zbMATH DE number 1002204
- Using sparsification for parametric minimum spanning tree problems
- Approximating minimum bounded degree spanning trees to within one of optimal
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Lower bounds on treespan
Cites Work
- Title not available (Why is that?)
- Improved bounds for planar \(k\)-sets and related problems
- Steiner trees, partial 2–trees, and minimum IFI networks
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Algorithms for two bottleneck optimization problems
- Two-phase algorithms for the parametric shortest path problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parametric Solution for Linear Bicriteria Knapsack Models
- Approximation schemes for the parametric knapsack problem
- Geometric lower bounds for parametric matroid optimization
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- An FPTAS for the parametric knapsack problem
- Finding the shortest bottleneck edge in a parametric minimum spanning tree
- Title not available (Why is that?)
- Network pricing problem with unit toll
- Notes on computing peaks in \(k\)-levels and parametric spanning trees
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
This page was built for publication: A stronger lower bound on parametric minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832875)
