Donation center location problem
From MaRDI portal
Publication:1949758
DOI10.1007/s00453-012-9633-7zbMath1272.68460OpenAlexW2070238212MaRDI QIDQ1949758
Chien-Chung Huang, Zoya Svitkina
Publication date: 16 May 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2321/
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and their coloring
- NP-completeness of some generalizations of the maximum matching problem
- Optimization, approximation, and complexity classes
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Modular decomposition and transitive orientation
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Reducing rank-maximal to maximum weight matching
- A threshold of ln n for approximating set cover
- On the np-completeness of certain network testing problems
- Popular Matchings
- Weighted Popular Matchings
- Dynamic facility location: The progressive p-median problem
- Non-approximability results for optimization problems on bounded degree instances
- Popular Matchings in the Capacitated House Allocation Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Algorithms and Computation
- College Admissions and the Stability of Marriage
This page was built for publication: Donation center location problem
