Pages that link to "Item:Q1296580"

The following pages link to Approximating the weight of shallow Steiner trees (Q1296580):

Displaying 29 items.

• Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
• Embedding rectilinear Steiner trees with length restrictions (Q344768) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
• Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
• Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
• Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
• Inapproximability of survivable networks (Q1019191) (← links)
• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
• Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
• On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
• The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
• Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
• Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
• On the characterization of the domination of a diameter-constrained network reliability model (Q2500537) (← links)
• A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
• The lower and upper forcing geodetic numbers of complete<i>n</i>-partite graphs,<i>n</i>-dimensional meshes and tori (Q3056403) (← links)
• The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions (Q3196405) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
• Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
• Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5918729) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)