The following pages link to Amit Kumar (Q486975):
Displaying 50 items.
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Building edge-failure resilient networks (Q818826) (← links)
- Approximation algorithms for the unsplittable flow problem (Q868438) (← links)
- Efficient load-balancing routing for wireless mesh networks (Q885092) (← links)
- Minimizing average flow-time under knapsack constraint (Q896150) (← links)
- Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
- Sampling in space restricted settings (Q1750353) (← links)
- Primal-dual algorithms for connected facility location problems (Q1884770) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- Battery scheduling problem (Q2327452) (← links)
- The heterogeneous capacitated \(k\)-center problem (Q2401151) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- On a bidirected relaxation for the MULTIWAY CUT problem (Q2565851) (← links)
- Wavelength Conversion in Optical Networks (Q2709790) (← links)
- A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems (Q2914307) (← links)
- Minimizing Average Flow-Time under Knapsack Constraint (Q2920494) (← links)
- Minimizing average flow time on related machines (Q2931433) (← links)
- Greedy Algorithms for Steiner Forest (Q2941584) (← links)
- Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. (Q2957500) (← links)
- Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees (Q2957504) (← links)
- Contact Center Scheduling with Strict Resource Requirements (Q3009760) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- Resource Allocation for Covering Time Varying Demands (Q3092259) (← links)
- All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959) (← links)
- Approximating Airports and Railways (Q3304099) (← links)
- Fairness Measures for Resource Allocation (Q3446812) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- Approximation via cost sharing (Q3546337) (← links)
- Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
- Multi-processor scheduling to minimize flow time with ε resource augmentation (Q3580981) (← links)
- Simpler and better approximation algorithms for network design (Q3581250) (← links)
- Minimizing Total Flow-Time: The Unrelated Case (Q3596738) (← links)
- Stochastic Steiner Tree with Non-uniform Inflation (Q3603461) (← links)
- Better Algorithms for Minimizing Average Flow-Time on Related Machines (Q3613759) (← links)
- Scheduling with Outliers (Q3638875) (← links)
- (Q4252334) (← links)
- (Q4411277) (← links)
- (Q4411292) (← links)
- Faster Algorithms for the Constrained k-Means Problem (Q4601868) (← links)
- (Q4607971) (← links)
- Design and Analysis of Algorithms (Q4611721) (← links)
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS) (Q4651544) (← links)
- (Q4737544) (← links)
- Approximation Algorithms for the Partition Vertex Cover Problem (Q4914442) (← links)
- Online and dynamic algorithms for set cover (Q4978000) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
