Centrality of trees for capacitated k-center

We consider the capacitated k -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign each location to an open center to minimize...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 154; no. 1-2; pp. 29 - 53
Main Authors:	An, Hyung-Chan, Bhaskara, Aditya, Chekuri, Chandra, Gupta, Shalmoli, Madan, Vivek, Svensson, Ola
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015
Subjects:	Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Approximation algorithms 68W25 LP-rounding algorithms Capacitated center problem Capacitated network location problems
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!