Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
DOI10.7155/JGAA.00485zbMATH Open1405.05176OpenAlexW2912702020MaRDI QIDQ4622772FDOQ4622772
Authors: Yuko Kuroki, Tomomi Matsui 
Publication date: 14 February 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00485
Recommendations
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- Approximation algorithms for the star \(k\)-hub center problem in metric graphs
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- scientific article; zbMATH DE number 7219313
- Algorithmic and hardness results for the hub labeling problem
- Approximation Algorithms for Network Design with Metric Costs
- Approximation algorithms for degree-constrained minimum-cost network-design problems
- Algorithms for solving the \(k\)-star hub problem for trees and series-parallel graphs
Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Network hub location problems: The state of the art
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A tight bound on approximating arbitrary metrics by tree metrics
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- The single allocation problem in the interacting three-hub network
- Tight bounds from a path based formulation for the tree of hub location problem
- Perspectives of Monge properties in optimization
- Exact and heuristic approaches for the cycle hub location problem
- Solving the hub location problem in a star–star network
- A study of the quadratic semi-assignment polytope
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A Monge property for the \(d\)-dimensional transportation problem
- Star \(p\)-hub median problem with modular arc capacities
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- A linear program for the two-hub location problem
- The Hardness of Metric Labeling
- Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
Cited In (4)
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
This page was built for publication: Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622772)
