Namyar, Pooria, Arzani, Behnaz, Kandula, Srikanth, Segarra, Santiago, Crankshaw, Daniel, Krishnaswamy, Umesh, Govindan, Ramesh, and Raj, Himanshu. Solving Max-Min Fair Resource Allocations Quickly on Large Graphs. Retrieved from https://par.nsf.gov/biblio/10512109. Usenix Symposium on Networked Systems Design and Implementation .

Namyar, Pooria, Arzani, Behnaz, Kandula, Srikanth, Segarra, Santiago, Crankshaw, Daniel, Krishnaswamy, Umesh, Govindan, Ramesh, & Raj, Himanshu. Solving Max-Min Fair Resource Allocations Quickly on Large Graphs. Usenix Symposium on Networked Systems Design and Implementation, (). Retrieved from https://par.nsf.gov/biblio/10512109.

Namyar, Pooria, Arzani, Behnaz, Kandula, Srikanth, Segarra, Santiago, Crankshaw, Daniel, Krishnaswamy, Umesh, Govindan, Ramesh, and Raj, Himanshu. "Solving Max-Min Fair Resource Allocations Quickly on Large Graphs". Usenix Symposium on Networked Systems Design and Implementation (). Country unknown/Code not available: Usenix. https://par.nsf.gov/biblio/10512109.

@article{osti_10512109,
place = {Country unknown/Code not available}, title = {Solving Max-Min Fair Resource Allocations Quickly on Large Graphs}, url = {https://par.nsf.gov/biblio/10512109}, abstractNote = {}, journal = {Usenix Symposium on Networked Systems Design and Implementation}, publisher = {Usenix}, author = {Namyar, Pooria and Arzani, Behnaz and Kandula, Srikanth and Segarra, Santiago and Crankshaw, Daniel and Krishnaswamy, Umesh and Govindan, Ramesh and Raj, Himanshu}, }