Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa. Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

This author has not been identified. Look up 'Chien-Chung Huang' in GoogleThis author has not been identified. Look up 'Mathieu Mari' in GoogleThis author has not been identified. Look up 'Claire Mathieu' in GoogleThis author has not been identified. Look up 'Joseph S. B. Mitchell' in GoogleThis author has not been identified. Look up 'Nabil H. Mustafa' in Google

runs on WebDSL