Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating the Generalized Minimum Manhattan Network Problem.

A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Algorithmica, 80 (4): 1170-1190 (2018)

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. You can also use the button next to the name to display some publications already assigned to the person.

Aparna Pareek

Aparna Kotha

Aparna Sharma

Aparna Renigunta

Aparna Jayachandran

Other publications of authors with the same name

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.A. Das, and C. Mathieu. SODA, page 390-403. SIAM, (2010)The Train Delivery Problem - Vehicle Routing Meets Bin Packing.A. Das, C. Mathieu, and S. Mozes. WAOA, volume 6534 of Lecture Notes in Computer Science, page 94-105. Springer, (2010)Polylogarithmic Approximation for Generalized Minimum Manhattan NetworksA. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13), Braunschweig, (March 2013)Greedy bidding strategies for keyword auctions.M. Cary, A. Das, B. Edelman, I. Giotis, K. Heimerl, A. Karlin, C. Mathieu, and M. Schwarz. EC, page 262-271. ACM, (2007)On Hierarchical Diameter-Clustering, and the Supplier Problem.A. Das, and C. Kenyon. WAOA, volume 4368 of Lecture Notes in Computer Science, page 132-145. Springer, (2006)A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routingA. Das, and C. Mathieu. CoRR, (2008)Approximating the Generalized Minimum Manhattan Network ProblemA. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Algorithmica, (March 2017)Approximation Schemes for Euclidean Vehicle Routing Problems.A. Das. Brown University, USA, (2011)Cybersecurity for Future Presidents: An Interdisciplinary Non-majors Course.A. Das, D. Voorhees, C. Choi, and C. Landwehr. SIGCSE, page 141-146. ACM, (2017)A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.A. Das, and C. Mathieu. Algorithmica, 73 (1): 115-142 (2015)

BibSonomy

Disambiguation of "Das, Aparna"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating the Generalized Minimum Manhattan Network Problem.

Please choose a person to relate this publication to

Aparna Pareek

Aparna Kotha

Aparna Sharma

Aparna Renigunta

Aparna Jayachandran

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Das, Aparna"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Approximating the Generalized Minimum Manhattan Network Problem.

Please choose a person to relate this publication to

Aparna Pareek

Aparna Kotha

Aparna Sharma

Aparna Renigunta

Aparna Jayachandran

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating the Generalized Minimum Manhattan Network Problem.