Amit Kumar

From MaRDI portal
Person:486975

Available identifiers

zbMath Open kumar.amitMaRDI QIDQ486975

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61474352024-01-15Paper
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time2023-12-19Paper
Bag-Of-Tasks Scheduling on Related Machines2023-11-20Paper
FPT Approximation for Constrained Metric k-Median/Means2023-11-13Paper
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)2022-10-14Paper
Caching with Time Windows and Delays2022-07-22Paper
https://portal.mardi4nfdi.de/entity/Q50911922022-07-21Paper
Non-Clairvoyant Precedence Constrained Scheduling.2022-07-21Paper
Stochastic makespan minimization in structured set systems2022-03-22Paper
Online Discrepancy with Recourse for Vectors and Graphs2021-11-11Paper
Fully-Dynamic Bin Packing with Little Repacking2021-07-28Paper
Non-Preemptive Flow-Time Minimization via Rejections2021-07-28Paper
A Local-Search Algorithm for Steiner Forest2021-06-15Paper
Approximate Clustering with Same-Cluster Queries2021-06-15Paper
Stochastic Load Balancing on Unrelated Machines2021-06-03Paper
Caching with time windows2021-01-19Paper
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time2020-10-26Paper
Approximating Airports and Railways2020-08-05Paper
Battery scheduling problem2019-10-15Paper
Elastic Caching2019-10-15Paper
Online Steiner Tree with Deletions2019-06-20Paper
Maintaining Assignments Online: Matching, Scheduling, and Flows2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q57434392019-05-10Paper
Design and Analysis of Algorithms2019-01-21Paper
Sampling in space restricted settings2018-05-18Paper
https://portal.mardi4nfdi.de/entity/Q46079712018-03-15Paper
Faster algorithms for the constrained \(k\)-means problem2018-03-01Paper
Faster Algorithms for the Constrained k-Means Problem2018-01-24Paper
Rejecting jobs to minimize load and maximum flow-time2017-10-11Paper
Rejecting jobs to Minimize Load and Maximum Flow-time2017-10-05Paper
New Approximation Schemes for Unsplittable Flow on a Path2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53651032017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651392017-09-29Paper
The heterogeneous capacitated \(k\)-center problem2017-08-31Paper
Online and dynamic algorithms for set cover2017-08-17Paper
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model.2017-07-13Paper
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings.2017-01-26Paper
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees2017-01-26Paper
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online2016-01-07Paper
Minimizing average flow-time under knapsack constraint2015-12-11Paper
Sampling in space restricted settings2015-10-29Paper
Greedy Algorithms for Steiner Forest2015-08-21Paper
Facility Location with Matroid or Knapsack Constraints2015-05-29Paper
Provisioning a virtual private network2015-02-27Paper
A constant-factor approximation for stochastic Steiner forest2015-02-04Paper
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation2015-02-04Paper
A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems2015-01-19Paper
Minimizing average flow time on related machines2014-11-25Paper
Approximation algorithms for the partition vertex cover problem2014-10-06Paper
Minimizing Average Flow-Time under Knapsack Constraint2014-09-26Paper
Connectivity and inference problems for temporal networks2014-09-26Paper
The power of deferral2014-08-07Paper
Approximation Algorithms for the Partition Vertex Cover Problem2013-04-12Paper
All-Norms and All-L_p-Norms Approximation Algorithms2012-10-19Paper
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems2012-09-25Paper
Resource Allocation for Covering Time Varying Demands2011-09-16Paper
Scheduling Resources for Throughput Maximization2011-08-17Paper
Contact Center Scheduling with Strict Resource Requirements2011-06-24Paper
Assigning papers to referees2010-10-07Paper
Simpler and better approximation algorithms for network design2010-08-16Paper
Multi-processor scheduling to minimize flow time with ε resource augmentation2010-08-15Paper
Linear-time approximation schemes for clustering problems in any dimensions2010-07-14Paper
Scheduling with Outliers2009-10-28Paper
Better Algorithms for Minimizing Average Flow-Time on Related Machines2009-03-12Paper
Stochastic Steiner Tree with Non-uniform Inflation2009-02-17Paper
Minimizing Total Flow-Time: The Unrelated Case2009-01-29Paper
Approximation via cost sharing2008-12-21Paper
The Priority k-Median Problem2008-04-24Paper
Order Scheduling Models: Hardness and Algorithms2008-04-24Paper
https://portal.mardi4nfdi.de/entity/Q54290802007-11-29Paper
Fairness Measures for Resource Allocation2007-06-26Paper
Efficient load-balancing routing for wireless mesh networks2007-06-08Paper
Approximation algorithms for the unsplittable flow problem2007-03-05Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Building edge-failure resilient networks2006-03-21Paper
Automata, Languages and Programming2006-01-10Paper
On a bidirected relaxation for the MULTIWAY CUT problem2005-09-28Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)2005-02-21Paper
Primal-dual algorithms for connected facility location problems2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47375442004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44112772003-07-07Paper
https://portal.mardi4nfdi.de/entity/Q44112922003-07-07Paper
Connectivity and inference problems for temporal networks2002-09-12Paper
Wavelength Conversion in Optical Networks2001-10-07Paper
https://portal.mardi4nfdi.de/entity/Q42523342001-09-23Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Amit Kumar