A Technique for Obtaining True Approximations for k-Center with Covering Constraints - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen. A Technique for Obtaining True Approximations for k-Center with Covering Constraints. In Daniel Bienstock, Giacomo Zambelli, editors, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. Volume 12125 of Lecture Notes in Computer Science, pages 52-65, Springer, 2020. [doi]

This author has not been identified. Look up 'Georg Anegg' in GoogleThis author has not been identified. Look up 'Haris Angelidakis' in GoogleThis author has not been identified. Look up 'Adam Kurpisz' in GoogleThis author has not been identified. Look up 'Rico Zenklusen' in Google

runs on WebDSL