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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 154; číslo 1-2; s. 29 - 53
Hlavní autoři:	An, Hyung-Chan, Bhaskara, Aditya, Chekuri, Chandra, Gupta, Shalmoli, Madan, Vivek, Svensson, Ola
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!