Apurva Mudgal

23 papers A* 1B 2C 2Journal 12Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Hardness and Approximation Schemes for Discrete Packing and Domination.
CoRR
Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit
2024 J jnl
Convexity of near-optimal orthogonal-pair-free sets on the unit sphere.
CoRR
Apurva Mudgal
2024 J jnl
Generalized class cover problem with axis-parallel strips.
Comput. Geom.
Apurva Mudgal, Supantha Pandit
2023 J jnl
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks.
Algorithmica
Raghunath Reddy Madireddy, Apurva Mudgal
2022 J jnl
Weighted geometric set cover with rectangles of bounded integer side lengths.
Discret. Appl. Math.
Raghunath Reddy Madireddy, Apurva Mudgal
2021 — ed.
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings
CALDAM
Apurva Mudgal, C. R. Subramanian
2020 B conf
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks.
WAOA
Raghunath Reddy Madireddy, Apurva Mudgal
2020 J jnl
Improved approximation algorithms for cumulative VRP with stochastic demands.
Discret. Appl. Math.
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
2019 J jnl
Approximability and hardness of geometric hitting set with axis-parallel rectangles.
Inf. Process. Lett.
Raghunath Reddy Madireddy, Apurva Mudgal
2019 J jnl
NP-hardness of geometric set cover and hitting set with rectangles containing a common point.
Inf. Process. Lett.
Raghunath Reddy Madireddy, Apurva Mudgal
2018 C conf
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.
COCOA
Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit
2016 — conf
Approximation Algorithms for Cumulative VRP with Stochastic Demands.
CALDAM
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
2016 J jnl
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions.
Discret. Appl. Math.
Apurva Mudgal, Supantha Pandit
2016 — conf
Stabbing Line Segments with Disks and Related Problems.
CCCG
Raghunath Reddy Madireddy, Apurva Mudgal
2015 C conf
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line.
COCOA
Apurva Mudgal, Supantha Pandit
2014 B conf
Generalized Class Cover Problem with Axis-Parallel Strips.
WALCOM
Apurva Mudgal, Supantha Pandit
2014 — conf
Geometric Hitting Set and Set Cover Problem with Half-Strips.
CCCG
Apurva Mudgal, Supantha Pandit
2013 J jnl
Routing vehicles to minimize fuel consumption.
Oper. Res. Lett.
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
2009 J jnl
A Near-Tight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput.
Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey
2009 — —
Worst-case robot navigation in deterministic environments.
Apurva Mudgal
2006 A* conf
A near-tight approximation lower bound and algorithm for the kidnapped robot problem.
SODA
Sven Koenig, Apurva Mudgal, Craig A. Tovey
2005 J jnl
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic.
SIAM J. Discret. Math.
Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig
2004 — conf
Analysis of Greedy Robot-Navigation Methods.
AI&M
Apurva Mudgal, Craig A. Tovey, Sven Koenig