ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
Article URLs:
Alternative Article URLs:
Authors: Chandra Chekuri
  • University of Illinois at Urbana-Champaign, Department of Computer Science
Kent Quanrud
  • University of Illinois at Urbana-Champaign, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1526799
DBLP Key: conf/soda/ChekuriQ17
Author Comments:

Discuss this paper and its artifacts below