scientific article; zbMATH DE number 1532274
From MaRDI portal
Publication:4517680
zbMATH Open0963.68231MaRDI QIDQ4517680FDOQ4517680
Authors: Yishay Mansour, David Peleg 
Publication date: 11 March 2001
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1003253
- scientific article; zbMATH DE number 1003254
- A primal-dual approximation algorithm for generalized Steiner network problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximation Algorithms for Network Design with Metric Costs
Reliability, availability, maintenance, inspection in operations research (90B25) Approximation algorithms (68W25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (21)
- Title not available (Why is that?)
- Edge-disjoint spanners in tori
- Low-light trees, and tight lower bounds for Euclidean spanners
- Approximation to the Minimum Cost Edge Installation Problem
- Oblivious buy-at-bulk in planar graphs
- Light spanners
- A deterministic algorithm for the cost-distance problem
- Truly Optimal Euclidean Spanners
- A network simplex algorithm for solving the minimum distribution cost problem
- Efficient algorithms for a simple network design problem
- Edge-disjoint spanners of complete graphs and complete digraphs
- Approximation algorithms for access network design
- Least-cost network topology design for a new service: An application of tabu search
- Network design with coverage costs
- Light Euclidean Spanners with Steiner Points
- An algorithm for the minimum variance point of a network
- A branch-and-cut approach for minimum cost multi-level network design
- Spanners and message distribution in networks.
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
- Approximation algorithms for general one-warehouse multi-retailer systems
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517680)
