The following publications are possibly variants of this publication:
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentationJivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara. stoc 2009: 679-684 [doi]
- Multi-processor scheduling to minimize flow time with epsilon resource augmentationChandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar. stoc 2004: 363-372 [doi]
- k-forest with resource augmentation: A primal-dual approachEric Angel, Nguyen Kim Thang, Shikha Singh 0002. TCS, 788:12-20, 2019. [doi]
- On Weighted Graph Separation Problems and Flow AugmentationEun Jung Kim 0002, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström. siamdm, 38(1):170-189, March 2024. [doi]