# Amit Kumar

According to our database

Collaborative distances:

^{1}, Amit Kumar authored at least 94 papers between 1989 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2020

Caching with Time Windows and Delays.

CoRR, 2020

Stochastic Makespan Minimization in Structured Set Systems.

CoRR, 2020

Caching with time windows.

Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Multiplicative Rank-1 Approximation using Length-Squared Sampling.

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract).

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Streaming PTAS for Binary 𝓁

_{0}-Low Rank Approximation.
CoRR, 2019

Streaming PTAS for Constrained k-Means.

CoRR, 2019

Battery Scheduling Problem.

Proceedings of the Theory and Applications of Models of Computation, 2019

Elastic Caching.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Tight FPT Approximations for k-Median and k-Means.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Non-Clairvoyant Precedence Constrained Scheduling.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Faster Algorithms for the Constrained k-means Problem.

Theory Comput. Syst., 2018

Rejecting jobs to minimize load and maximum flow-time.

J. Comput. Syst. Sci., 2018

Sampling in Space Restricted Settings.

Algorithmica, 2018

Approximating Airports and Railways.

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Stochastic Load Balancing on Unrelated Machines.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Approximate Clustering with Same-Cluster Queries.

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

A Local-Search Algorithm for Steiner Forest.

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Non-Preemptive Flow-Time Minimization via Rejections.

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Fully-Dynamic Bin Packing with Little Repacking.

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Fully-Dynamic Bin Packing with Limited Repacking.

CoRR, 2017

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines.

Algorithmica, 2017

Online and dynamic algorithms for set cover.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

The Heterogeneous Capacitated k-Center Problem.

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

SpectraMap: Efficiently Constructing a Spatio-temporal RF Spectrum Occupancy Map.

Proceedings of the Communication Systems and Networks - 9th International Conference, 2017

2016

Minimizing average flow-time under knapsack constraint.

Theor. Comput. Sci., 2016

The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online.

SIAM J. Comput., 2016

2015

Facility Location with Matroid or Knapsack Constraints.

Math. Oper. Res., 2015

Greedy Algorithms for Steiner Forest.

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

New Approximation Schemes for Unsplittable Flow on a Path.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model.

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Approximation algorithms for the partition vertex cover problem.

Theor. Comput. Sci., 2014

A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems.

Algorithmica, 2014

Maintaining Assignments Online: Matching, Scheduling, and Flows.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Online Steiner Tree with Deletions.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2012

Resource augmentation for weighted flow-time explained by dual fitting.

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Single-path routing for life time maximization in multi-hop wireless networks.

Wirel. Networks, 2011

Approximation Algorithms for Edge Partitioned Vertex Cover Problems

CoRR, 2011

On LP-Based Approximability for Strict CSPs.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

The Matroid Median Problem.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Minimum Cost Resource Allocation for Meeting Job Requirements.

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Contact Center Scheduling with Strict Resource Requirements.

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Resource Allocation for Covering Time Varying Demands.

Proceedings of the Algorithms - ESA 2011, 2011

Scheduling Resources for Throughput Maximization.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Linear-time approximation schemes for clustering problems in any dimensions.

J. ACM, 2010

Assigning Papers to Referees.

Algorithmica, 2010

Clustering with Spectral Norm and the k-Means Algorithm.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

On the Optimality of a Class of LP-based Algorithms.

Electronic Colloquium on Computational Complexity (ECCC), 2009

A constant-factor approximation for stochastic Steiner forest.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Scheduling with Outliers.

Proceedings of the Approximation, 2009

2008

Minimizing Total Flow-Time: The Unrelated Case.

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

All-Norms and All-L_p-Norms Approximation Algorithms.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Efficient Parallel Implementations of Binomial Tree Option Price Valuation.

Proceedings of the ISCA 21st International Conference on Parallel and Distributed Computing and Communication Systems, 2008

2007

Approximation via cost sharing: Simpler and better approximation algorithms for network design.

J. ACM, 2007

Efficient load-balancing routing for wireless mesh networks.

Comput. Networks, 2007

Approximation Algorithms for the Unsplittable Flow Problem.

Algorithmica, 2007

The Priority

*k*-Median Problem.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Order Scheduling Models: Hardness and Algorithms.

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Minimizing Average Flow-time : Upper and Lower Bounds.

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

On Configuring BGP Route Reflectors.

Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), 2007

Stochastic Steiner Tree with Non-uniform Inflation.

Proceedings of the Approximation, 2007

2006

Fairness Measures for Resource Allocation.

SIAM J. Comput., 2006

Minimizing average flow time on related machines.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Better Algorithms for Minimizing Average Flow-Time on Related Machines.

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Enhanced distributed hash tables for complex queries.

Proceedings of the First International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2006), 2006

2005

Wavelet synopses for general error metrics.

ACM Trans. Database Syst., 2005

XML stream processing using tree-edit distance embeddings.

ACM Trans. Database Syst., 2005

On a bidirected relaxation for the MULTIWAY CUT problem.

Discret. Appl. Math., 2005

Building Edge-Failure Resilient Networks.

Algorithmica, 2005

Join-distinct aggregate estimation over update streams.

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Linear Time Algorithms for Clustering Problems in Any Dimensions.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Where's the Winner? Max-Finding and Sorting with Metric Costs.

Proceedings of the Approximation, 2005

2004

Traveling with a Pez Dispenser (or, Routing Issues in MPLS).

SIAM J. Comput., 2004

Primal-Dual Algorithms for Connected Facility Location Problems.

Algorithmica, 2004

Multi-processor scheduling to minimize flow time with epsilon resource augmentation.

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Deterministic Wavelet Thresholding for Maximum-Error Metrics.

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions.

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Maximum Coverage Problem with Group Budget Constraints and Applications.

Proceedings of the Approximation, 2004

2003

Optimal configuration of OSPF aggregates.

IEEE/ACM Trans. Netw., 2003

Simpler and better approximation algorithms for network design.

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Tree based MPLS routing.

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Correlating XML data streams using tree-edit distance embeddings.

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Exploring the trade-off between label size and stack depth in MPLS Routing.

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Algorithms for provisioning virtual private networks in the hose model.

IEEE/ACM Trans. Netw., 2002

Connectivity and Inference Problems for Temporal Networks.

J. Comput. Syst. Sci., 2002

A Constant-Factor Approximation Algorithm for the Multicommodity.

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Wavelength Conversion in Optical Networks.

J. Algorithms, 2001

Provisioning a virtual private network: a network design problem for multicommodity flow.

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Sorting and Selection with Structured Costs.

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

1989

An architecture for heterogeneous computer integrated manufacturing system.

Proceedings of the Computer Trends in the 1990s, 1989