Donation Center Location Problem
From MaRDI portal
Publication:2920129
DOI10.4230/LIPICS.FSTTCS.2009.2321zbMath1248.68559OpenAlexW3023887031MaRDI QIDQ2920129
Zoya Svitkina, Chien-Chung Huang
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_0c17.html
Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
Tight approximation bounds for combinatorial frugal coverage algorithms ⋮ Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
This page was built for publication: Donation Center Location Problem
