Efficient algorithms for a simple network design problem

DOI10.1002/NET.21500MaRDI QIDQ2811297zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmefficient algorithmNP-completenesssimple network designsmall-world network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

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

Cites work

• A quadratic integer program for the location of interacting hub facilities
• Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
• Collective dynamics of `small-world' networks
• Combinatorial optimization. Networks and matroids
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1950482 (Why is no real title available?)
• The single allocation problem in the interacting three-hub network
• The Structure and Function of Complex Networks
• The vehicle routing problem

Cited in

(2)

• Graph simplification for infrastructure network design
• Efficient points on a network

Describes a project that uses

Uses Software

• VRP

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)