A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case

03/16/2018
by   Yuko Kuroki, et al.
0

Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. Hub facilities work as switching points for flows in large networks. In this study, we deal with a problem, called the single allocation hub-and-spoke network design problem. In the problem, the goal is to allocate each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. The problem is essentially equivalent to another combinatorial optimization problem, called the metric labeling problem. The metric labeling problem was first introduced by Kleinberg and Tardos in 2002, motivated by application to segmentation problems in computer vision and related areas. In this study, we deal with the case where the set of hubs forms a star, which arises especially in telecommunication networks. We propose a polynomial-time randomized approximation algorithm for the problem, whose approximation ratio is less than 5.281. Our algorithms solve a linear relaxation problem and apply dependent rounding procedures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2020

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

One of the most fundamental results in combinatorial optimization is the...
research
03/21/2018

Similar Elements and Metric Labeling on Complete Graphs

We consider a problem that involves finding similar elements in a collec...
research
07/14/2023

A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots

One of the most studied extensions of the famous Traveling Salesperson P...
research
07/22/2021

The Traveling Firefighter Problem

We introduce the L_p Traveling Salesman Problem (L_p-TSP), given by an o...
research
07/14/2023

An Approximation Algorithm for Multi Allocation Hub Location Problems

The multi allocation p-hub median problem (MApHM), the multi allocation ...
research
08/19/2023

Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm

Carbon footprint optimization (CFO) is important for sustainable heavy-d...
research
02/16/2021

A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy

Performing inference in graphs is a common task within several machine l...

Please sign up or login with your details

Forgot password? Click here to reset