Approximating the weight of shallow Steiner trees
From MaRDI portal
Publication:1296580
Recommendations
Cites work
- scientific article; zbMATH DE number 1003287 (Why is no real title available?)
- scientific article; zbMATH DE number 1003288 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1303557 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 6472583 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximation algorithms for combinatorial problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Balancing minimum spanning trees and shortest-path trees
- Generalized submodular cover problems and applications
- Many birds with one stone
- On the hardness of approximating minimization problems
- On the ratio of optimal integral and fractional covers
- Routing to Multiple Destinations in Computer Networks
- The network inhibition problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
Cited in
(34)- Approximating Steiner trees in graphs with restricted weights
- Delay-constrained minimum shortest path trees and related problems
- Delay-constrained minimum shortest path trees and related problems
- Tight bounds on subexponential time approximation of set cover and related problems
- Differential approximation of NP-hard problems with equal size feasible solutions
- The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
- The rectilinear Steiner tree problem with given topology and length restrictions
- Embedding rectilinear Steiner trees with length restrictions
- Shallow-light Steiner arborescences with vertex delays
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Improved approximation algorithms for directed Steiner forest
- Bounded-diameter minimum-cost graph problems
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
- Bounded-hops power assignment in ad hoc wireless networks
- A greedy approximation algorithm for the group Steiner problem
- Bounded Degree Group Steiner Tree Problems
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- On the bounded-hop MST problem on random Euclidean instances
- Approximating \(k\)-hop minimum-spanning trees
- Algorithms for the minimum diameter terminal Steiner tree problem
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Inapproximability of survivable networks
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Finding bounded diameter minimum spanning tree in general graphs
- Low-light trees, and tight lower bounds for Euclidean spanners
- The lower and upper forcing geodetic numbers of block--cactus graphs
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Approximating fault-tolerant group-Steiner problems
- On the characterization of the domination of a diameter-constrained network reliability model
This page was built for publication: Approximating the weight of shallow Steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296580)
