Apurva Mudgal

According to our database1, Apurva Mudgal authored at least 18 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Convexity of near-optimal orthogonal-pair-free sets on the unit sphere.
CoRR, 2024

Generalized class cover problem with axis-parallel strips.
Comput. Geom., 2024

2023
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks.
Algorithmica, 2023

2022
Weighted geometric set cover with rectangles of bounded integer side lengths.
Discret. Appl. Math., 2022

2020
Improved approximation algorithms for cumulative VRP with stochastic demands.
Discret. Appl. Math., 2020

2019
Approximability and hardness of geometric hitting set with axis-parallel rectangles.
Inf. Process. Lett., 2019

NP-hardness of geometric set cover and hitting set with rectangles containing a common point.
Inf. Process. Lett., 2019

2018
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.
Proceedings of the Combinatorial Optimization and Applications, 2018

2016
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions.
Discret. Appl. Math., 2016

Stabbing Line Segments with Disks and Related Problems.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Approximation Algorithms for Cumulative VRP with Stochastic Demands.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Geometric Hitting Set and Set Cover Problem with Half-Strips.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Routing vehicles to minimize fuel consumption.
Oper. Res. Lett., 2013

2009
A Near-Tight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput., 2009

2006
A near-tight approximation lower bound and algorithm for the kidnapped robot problem.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic.
SIAM J. Discret. Math., 2005

2004
Analysis of Greedy Robot-Navigation Methods.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004


  Loading...