Disjoint-Path Facility Location: Theory and Practice

DOI10.1137/1.9781611972917.7zbMath1429.68185OpenAlexW2295381714MaRDI QIDQ5233698

Yu Gu, Subhabrata Sen, N. G. Duffield, Lee Breslau, Ilias Diakonikolas, Mauricio G. C. Resende, David S. Johnson, Howard J. Karloff, Mohammad Taghi Hajiaghayi

Publication date: 12 September 2019

Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/36f10df449abe0502f263666191010696ff60d47

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Wireless sensor networks as related to computer science (68M18)

Related Items

Improved approximation algorithms for label cover problems ⋮ Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs