Worst-Case Analysis of Network Design Problem Heuristics
From MaRDI portal
Cites work
- A Computational Approach to the Selection of an Optimal Network
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 3593565 (Why is no real title available?)
- On the Computational Complexity of Combinatorial Problems
- Optimal subset selection. Multiple regression, interdependence and optimal network algorithms
- P-Complete Approximation Problems
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Reducibility among combinatorial problems
- The Complexity of Near-Optimal Graph Coloring
- The complexity of the network design problem
Cited in
(22)- Efficient methods for multiple sequence alignment with guaranteed error bounds
- Approximation algorithms for some optimum communication spanning tree problems
- Approximation algorithms for the shortest total path length spanning tree problem
- Low complexity variants of the arrow distributed directory
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Bounded-degree light approximate shortest-path trees in doubling metrics
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- On the minimum routing cost clustered tree problem
- Distance preserving subtrees in minimum average distance spanning trees
- Models and algorithms for network reduction
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Light graphs with small routing cost
- Exact algorithms for minimum routing cost trees
- Finding best swap edges minimizing the routing cost of a spanning tree
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Compact location problems with budget and communication constraints
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- Spanning trees: A survey
- Approximating total effective resistance minimization with small budget
- Approximating total effective resistance minimization with small budget
- On the intercluster distance of a tree metric
- On the minimum average distance spanning tree of the hypercube
This page was built for publication: Worst-Case Analysis of Network Design Problem Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964299)
