Efficient algorithms for a simple network design problem
DOI10.1002/NET.21500zbMATH Open1338.68014OpenAlexW2043092513MaRDI QIDQ2811297FDOQ2811297
Authors: Ryuhei Uehara, Takeaki Uno, Shin-Ichi Nakano 
Publication date: 10 June 2016
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21500
Recommendations
- scientific article; zbMATH DE number 1532274
- Approximation algorithms for degree-constrained minimum-cost network-design problems
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Heuristics for the network design problem with connectivity requirements
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cites Work
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- A quadratic integer program for the location of interacting hub facilities
- The vehicle routing problem
- The single allocation problem in the interacting three-hub network
- Combinatorial optimization. Networks and matroids
- Title not available (Why is that?)
- Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
Cited In (2)
Uses Software
This page was built for publication: Efficient algorithms for a simple network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811297)
