Pages that link to "Item:Q2819606"

The following pages link to Design networks with bounded pairwise distance (Q2819606):

Displaying 39 items.

• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• Augmenting graphs to minimize the diameter (Q494792) (← links)
• Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
• Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
• Improved approximation algorithms for label cover problems (Q634686) (← links)
• Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
• On minimum generalized Manhattan connections (Q832842) (← links)
• Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
• Inapproximability of survivable networks (Q1019191) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• Tree-decompositions with bags of small diameter (Q2370441) (← links)
• Spanners for bounded tree-length graphs (Q2383601) (← links)
• A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
• Approximating node-connectivity augmentation problems (Q2429349) (← links)
• The subdivision-constrained routing requests problem (Q2436672) (← links)
• Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees (Q2954999) (← links)
• Network Design with Coverage Costs (Q2969041) (← links)
• Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
• Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
• A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
• Distributed Distance-Bounded Network Design Through Distributed Convex Programming (Q3300803) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• Online Buy-at-Bulk Network Design (Q4577806) (← links)
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
• (Q5091070) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
• Approximating Steiner Networks with Node Weights (Q5458547) (← links)
• (Q5743494) (← links)
• (Q5874542) (← links)
• Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5899375) (← links)
• Tree spanners in planar graphs (Q5928870) (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
• Augmenting graphs to minimize the radius (Q6114475) (← links)
• Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)