Design networks with bounded pairwise distance
From MaRDI portal
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)
Recommendations
- Network-design with degree constraints
- Network design with edge-connectivity and degree constraints
- Network Design with Edge-Connectivity and Degree Constraints
- Degree bounded network design with metric costs
- Network Design with Weighted Degree Constraints
- Network design with weighted degree constraints
- scientific article; zbMATH DE number 2161745
- On approximating degree-bounded network design problems
- On approximating degree-bounded network design problems
- scientific article; zbMATH DE number 1532276
Cited in
(44)- Inapproximability of survivable networks
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Tree-decompositions with bags of small diameter
- Spanners for bounded tree-length graphs
- A polynomial-time algorithm for outerplanar diameter improvement
- Approximating node-connectivity augmentation problems
- The subdivision-constrained routing requests problem
- Augmenting forests to meet odd diameter requirements
- Bulk-robust combinatorial optimization
- Network design problems with bounded distances via shallow-light Steiner trees
- Network design with coverage costs
- Improved approximation for the directed spanner problem
- Approximability of unsplittable shortest path routing problems
- A polynomial-time algorithm for outerplanar diameter improvement
- Distributed distance-bounded network design through distributed convex programming
- Fast algorithms for diameter-optimally augmenting paths
- Improved approximation algorithms for directed Steiner forest
- Online Buy-at-Bulk Network Design
- ETH-hardness of approximating 2-CSPs and directed Steiner network
- Parameterized approximation algorithms for bidirected Steiner network problems
- Shortcutting directed and undirected networks with a degree constraint
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Covering clients with types and budgets
- A Spectral Approach to Network Design
- Fast algorithms for diameter-optimally augmenting paths and trees
- Approximating Steiner Networks with Node Weights
- Approximating survivable networks with \(\beta \)-metric costs
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Tree spanners in planar graphs
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Augmenting graphs to minimize the radius
- An ETH-tight algorithm for bidirected Steiner connectivity
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms
- Improved approximation algorithms for label cover problems
- Simple approximations for general spanner problems
- Finding smallest witnesses for conjunctive queries
- The strongish planted clique hypothesis and its consequences
- Survivable network design with group-to-group requirement
- Directed buy-at-bulk spanners
- Improved approximability and non-approximability results for graph diameter decreasing problems
- On minimum generalized Manhattan connections
- Tight approximation algorithm for connectivity augmentation problems
This page was built for publication: Design networks with bounded pairwise distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819606)
