|
Welcome to my homepage! I received my Ph.D. in May 2017 from the Department of Computer Science at the University of Maryland, College Park. I was very fortunate to be advised by Prof. Aravind Srinivasan. For research, I am interested in the broad area of Theoretical Computer Science. My research interests include Combinatorial Optimization, Approximation Algorithms, and Randomized Algorithms. In particular, I worked on some classic facility-location problems and clustering problems such as k-median, k-center, and other variants. I joined Google since July 2017. |
|
Publications
Journal papers
-
An Improved Approximation Algorithm for Knapsack Median Using Sparsification,
with
J. Byrka,
T. Pensyl,
B. Rybicki,
J. Spoerhase,
and
A. Srinivasan.
Accepted for publication in Algorithmica, subject to a minor revision.
-
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization,
with
J. Byrka,
T. Pensyl,
B. Rybicki, and
A. Srinivasan.
ACM Transactions on Algorithms, accepted for publication. (Special issue of ACM TALG devoted to elected papers from SODA 2015.)
Conference papers
-
A Lottery Model for Center-type Problems with Outliers, with
D. G. Harris,
T. Pensyl,
and
A. Srinivasan.
To appear, Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2017. (The full version is here.)
-
An Improved Approximation Algorithm for Knapsack Median Using Sparsification,
with
J. Byrka,
T. Pensyl,
B. Rybicki,
J. Spoerhase,
and
A. Srinivasan.
Proc. European Symposium on Algorithms (ESA), pages 275-287, 2015. (This is a full version of the paper.)
-
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization,
with
J. Byrka,
T. Pensyl,
B. Rybicki, and
A. Srinivasan.
Proc. ACM-Siam Symposium on Discrete Algorithms (SODA), pages 737-756, 2015. (The link here is to an extended version that corrects an error in the SODA version.)
-
"Beating the news" with EMBERS: Forecasting Civil Unrest using Open
Source Indicators,
with
N. Ramakrishnan et. al.
Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), pages 1799-1808, 2014.
-
A Stochastic Optimization Method for Solving the Machine-Part
Cell Formation Problem, with J. Ferland, and T. Dinh. Proc. International Conference on Intelligent Computing (ICIC), pages 162-169, 2011.
-
An Approximation Approach for a Real-World Variant of Vehicle Routing Problem, with N. Dang, and T. Dinh. Proc. Asian Conference on Intelligent Information and Database (ACIIDS), pages 87-96, 2011.
Manuscripts
-
Optimizing Access to Healthcare Facilities During Pandemic Outbreaks, with
A. Vullikanti et. al. (working)
-
Fairness in Resource Allocation and Slowed-down Dependent Rounding, with
D. G. Harris,
T. Pensyl,
and
A. Srinivasan.
(submitted)
Talks
-
A Lottery Model for Center-type Problems with Outliers. APPROX 2017. University of California, Berkeley.
-
An Improved Approximation Algorithm for Knapsack Median. Capital Area Theory Seminar (CATS) - Fall 2015. University of Maryland.
-
Improved Approximation for k-median, and Near Independence in Dependent Rounding. 22nd International Symposium on Mathematical Programming (ISMP). July 2015. Pittsburgh, PA.
Contact
- A Lottery Model for Center-type Problems with Outliers, with D. G. Harris, T. Pensyl, and A. Srinivasan. To appear, Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2017. (The full version is here.)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification, with J. Byrka, T. Pensyl, B. Rybicki, J. Spoerhase, and A. Srinivasan. Proc. European Symposium on Algorithms (ESA), pages 275-287, 2015. (This is a full version of the paper.)
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization, with J. Byrka, T. Pensyl, B. Rybicki, and A. Srinivasan. Proc. ACM-Siam Symposium on Discrete Algorithms (SODA), pages 737-756, 2015. (The link here is to an extended version that corrects an error in the SODA version.)
- "Beating the news" with EMBERS: Forecasting Civil Unrest using Open Source Indicators, with N. Ramakrishnan et. al. Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), pages 1799-1808, 2014.
- A Stochastic Optimization Method for Solving the Machine-Part Cell Formation Problem, with J. Ferland, and T. Dinh. Proc. International Conference on Intelligent Computing (ICIC), pages 162-169, 2011.
- An Approximation Approach for a Real-World Variant of Vehicle Routing Problem, with N. Dang, and T. Dinh. Proc. Asian Conference on Intelligent Information and Database (ACIIDS), pages 87-96, 2011.