Kumar, Amit - Department of Computer Science and Engineering, Indian Institute of Technology, Delhi

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Kumar, Amit - Department of Computer Science and Engineering, Indian Institute of Technology, Delhi

Sorting and Selection with Structured Costs Anupam Gupta \Lambda
Approximation Algorithms for the Unsplittable Flow Problem
Algorithmica DOI 10.1007/s00453-009-9386-0
Minimizing Average Flow Time on Related Machines Naveen Garg Amit Kumar
Optimal Configuration of OSPF Aggregates Yuri Breitbart Minos Garofalakis Amit Kumar \Lambda R. Rastogi
Building EdgeFailure Resilient Networks C. Chekuri 1 and A. Gupta 1 and A. Kumar 2 and J. Naor 3 and D. Raz 3
A Simple Linear Time (1 + #)Approximation Algorithm for kMeans Clustering in Any Dimensions
Primal-Dual Algorithms for Connected Facility Location Problems
Minimizing average flowtime : the unrelated Naveen Garg, Amit Kumar, and V.N. Muralidhara
Better Algorithms for Minimizing Average Flowtime on Related Naveen Garg Amit Kumar
Approximation Via CostSharing: A Simple Approximation Algorithm for the Multicommodity RentorBuy Problem
A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem
Simpler and Better Approximation Algorithms for Network Anupam Gupta Amit Kumar y Tim Roughgarden z
A Competitive Algorithm for Minimizing Weighted Flow Time on Unrelated Machines with Speed Augmentation
Algorithms for Provisioning Virtual Private Networks in the Hose Paper ID Number: 286 Num Pages: 27
Minimizing Average Flow-time : Upper and Lower Bounds Naveen Garg
Constant Factor Approximation Algorithm for the Knapsack Median Problem
Resource Augmentation for Weighted Flow-time explained by Dual Fitting