Back to Results
First PageMeta Content



List of Publications a. Survey N. Garg, “Minimizing Average Flow-Time”, Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Lecture Notes in Computer Science: 187-1
Add to Reading List

Document Date: 2013-04-30 00:27:30


Open Document

File Size: 424,12 KB

Share Result on Facebook

Company

SIAM Journal / /

Facility

Facility Location / /

IndustryTerm

combinatorial algorithm / simpler algorithms / poly-logarithmic approximation algorithm / polylogarithmic approximation algorithm / approximation algorithm / parallel disk systems / Wireless Networks / approximation algorithms / /

NaturalFeature

Steiner forest / /

Person

A. Kumar / V / R. Khandekar / V / Kurt Mehlhorn / N. Garg / V / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / Theoretical Computer Science / Theory of Computing / Lecture Notes in Computer Science / /

Technology

Approximation Algorithms / 3-approximation algorithm / randomized algorithm / Software Technology / polylogarithmic approximation algorithm / combinatorial algorithm / Primal-dual approximation algorithms / approximation algorithm / Faster and Simpler Algorithms / poly-logarithmic approximation algorithm / /

SocialTag