( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating the Generalized Minimum Manhattan Network Problem

, , , , , и . Algorithmica, (марта 2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Aparna Pareek

Aparna Kotha

Aparna Sharma

Aparna Renigunta

Aparna Jayachandran

 

Другие публикации лиц с тем же именем

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing., и . SODA, стр. 390-403. SIAM, (2010)The Train Delivery Problem - Vehicle Routing Meets Bin Packing., , и . WAOA, том 6534 из Lecture Notes in Computer Science, стр. 94-105. Springer, (2010)Approximating the Generalized Minimum Manhattan Network Problem, , , , , и . Algorithmica, (марта 2017)A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing, и . CoRR, (2008)Approximation Schemes for Euclidean Vehicle Routing Problems.. Brown University, USA, (2011)Cybersecurity for Future Presidents: An Interdisciplinary Non-majors Course., , , и . SIGCSE, стр. 141-146. ACM, (2017)Greedy bidding strategies for keyword auctions., , , , , , , и . EC, стр. 262-271. ACM, (2007)On Hierarchical Diameter-Clustering, and the Supplier Problem., и . WAOA, том 4368 из Lecture Notes in Computer Science, стр. 132-145. Springer, (2006)Polylogarithmic Approximation for Generalized Minimum Manhattan Networks, , , , , и . Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13), Braunschweig, (марта 2013)A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing., и . Algorithmica, 73 (1): 115-142 (2015)