Kanthi K Sarpatwar  Kanthi K Sarpatwar photo         

contact information

Research Staff Member
Thomas J. Watson Research Center, Yorktown Heights, NY USA
  +1dash914dash945dash4039

links



2018

Brief Announcement: The Preemptive Resource Allocation Problem
Kanthi Sarpatwar, Baruch Schieber and Hadas Shachnai
In the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018

Generalized Assignment of Time-Sensitive Item Groups
Kanthi K. Sarpatwar, Baruch Schieber and Hadas Shachnai
In the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2018

Constrained Submodular Maximization via Greedy Local Search
Kanthi K. Sarpatwar, Baruch Schieber and Hadas Shachnai
Accepted to Operations Research Letters (ORL), 2018


2017

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice
Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu
In the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 2017

On Maximum Leaf Trees and Connections to Connected Maximum Cut Problems.
Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar
Information Processing Letters, 2017


2015

The Container Selection Problem
Viswanath Nagarajan, Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai and Joel Wolf
In the 18th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2015

Approximation Algorithms for Connected Maximum Cut and Related Problems
Mohammadtaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit and Kanthi Sarpatwar
In the 23rd Annual European Symposium on Algorithms (ESA), 2015


2014

The X-Flex Cross-Platform Scheduler: Who's The Fairest Of Them All?
Joel Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring and Kanthi Sarpatwar
In the 15th ACM/IFIP/USENIX Middleware 2014 - Industry Track.

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014


2012

New Approximation Results for Resource Replication Problems
Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
In the 15th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Full journal version in: Algorithmica, Volume 74, 2016, 2012


2011

Hardness of Subgraph and Supergraph Problems in r-tournaments
Kanthi K. Sarpatwar, Narayanaswamy N. S.
Theoretical Computer Science (TCS), 2011

Rainbow Connectivity; Hardness and Tractability
Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011


Year Unknown

Improved Algorithms for Steiner Tree and Cheapest Tour Oracles
Randeep Bhatia, Bhawna Gupta, Kanthi K. Sarpatwar
0

Approximation Algorithms for Covering Problems in Energy Constrained Wireless Networks
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
0