The maximum \(f\)-depth spanning tree problem
From MaRDI portal
Publication:1603381
DOI10.1016/S0020-0190(01)00160-0zbMath1032.68087OpenAlexW2019955382MaRDI QIDQ1603381
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00160-0
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ Differential approximation of NP-hard problems with equal size feasible solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- The Steiner problem with edge lengths 1 and 2
- Structure preserving reductions among convex optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- Multicommodity flow models for spanning trees with hop constraints
- Designing reliable tree networks with two cable technologies
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Bicriteria Network Design Problems
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Approximating k-set cover and complementary graph coloring
- The Traveling Salesman Problem with Distances One and Two
This page was built for publication: The maximum \(f\)-depth spanning tree problem
