( en | de | ru )

 

Disambiguation of "Mudgal, Apurva"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.

, , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 421-435. Springer, (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.

Apurva Mohan

 

Other publications of authors with the same name

Stabbing Line Segments with Disks and Related Problems., and . CCCG, page 201-207. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Geometric Hitting Set and Set Cover Problem with Half-Strips., and . CCCG, Carleton University, Ottawa, Canada, (2014)Approximation Algorithms for Cumulative VRP with Stochastic Demands., , and . CALDAM, volume 9602 of Lecture Notes in Computer Science, page 176-189. Springer, (2016)Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems., , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 421-435. Springer, (2018)A near-tight approximation lower bound and algorithm for the kidnapped robot problem., , and . SODA, page 133-142. ACM Press, (2006)Convexity of near-optimal orthogonal-pair-free sets on the unit sphere.. CoRR, (2024)Generalized Class Cover Problem with Axis-Parallel Strips., and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 8-21. Springer, (2014)Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic., , , and . SIAM J. Discret. Math., 19 (2): 431-447 (2005)Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line., and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 126-137. Springer, (2015)Analysis of Greedy Robot-Navigation Methods., , and . AI&M, (2004)