{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:11:45Z","timestamp":1648631505189},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,22]],"date-time":"2010-05-22T00:00:00Z","timestamp":1274486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-010-9321-y","type":"journal-article","created":{"date-parts":[[2010,5,21]],"date-time":"2010-05-21T15:59:32Z","timestamp":1274457572000},"page":"426-437","source":"Crossref","is-referenced-by-count":0,"title":["Why locally-fair maximal flows in client-server networks perform well"],"prefix":"10.1007","volume":"22","author":[{"given":"Kenneth A.","family":"Berman","sequence":"first","affiliation":[]},{"given":"Chad","family":"Yoshikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,22]]},"reference":[{"key":"9321_CR1","doi-asserted-by":"crossref","unstructured":"Annexstein F, Berman KA, Strunjas S, Yoshikawa C (2007) Maximizing throughput in minimum rounds in an application-level relay service. In: Workshop on algorithm engineering & experiments (ALENEX)","DOI":"10.1137\/1.9781611972870.11"},{"key":"9321_CR2","first-page":"197","volume-title":"SODA \u201905: proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms","author":"B Awerbuch","year":"2005","unstructured":"Awerbuch B, Hajiaghayi MT, Kleinberg RD, Leighton T (2005) Online client-server load balancing without global information. In: SODA \u201905: proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp\u00a0197\u2013206"},{"key":"9321_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/11533719_71","volume-title":"Computing and combinatorics: 11th annual international conference, COCOON 2005","author":"J Cardinal","year":"2005","unstructured":"Cardinal J, Labb\u00e9 M, Langerman S, Levy E, M\u00e9lot H (2005) A tight analysis of the maximal matching heuristic. In: Computing and combinatorics: 11th annual international conference, COCOON 2005. Lecture notes in computer science, vol\u00a03595. Springer, Kunming, pp\u00a0701\u2013709"},{"key":"9321_CR4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/297096.297140","volume":"3","author":"BV Cherkassky","year":"1998","unstructured":"Cherkassky BV, Goldberg AV, Martin P, Setubal JC, Stolfi J (1998) Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. J Exp Algorithmics 3:8. http:\/\/doi.acm.org\/10.1145\/297096.297140","journal-title":"J Exp Algorithmics"},{"issue":"1\u20133","key":"9321_CR5","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.dam.2003.10.004","volume":"143","author":"A Czygrinow","year":"2004","unstructured":"Czygrinow A, Ha\u0144\u0107kowiak M, Szyma\u0144ska E (2004) Distributed algorithm for approximating the maximum matching. Discrete Appl Math 143(1\u20133):62\u201371. doi: 10.1016\/j.dam.2003.10.004","journal-title":"Discrete Appl Math"},{"key":"9321_CR6","unstructured":"Hanckowiak, Karonski, Panconesi (1998) On the distributed complexity of computing maximal matchings. In: SODA: ACM-SIAM symposium on discrete algorithms, a conference on theoretical and experimental analysis of discrete algorithms. citeseer.ist.psu.edu\/article\/hanckowiak97distributed.html"},{"key":"9321_CR7","volume-title":"Computer networking: a\u00a0top-down approach featuring the Internet package","author":"JF Kurose","year":"2000","unstructured":"Kurose JF, Ross KW (2000) Computer networking: a\u00a0top-down approach featuring the Internet package. Addison-Wesley, Boston"},{"key":"9321_CR8","doi-asserted-by":"crossref","unstructured":"Qiu D, Srikant R (2004) Modeling and performance analysis of bittorrent-like peer-to-peer networks. URL citeseer.ist.psu.edu\/qiu04modeling.html","DOI":"10.1145\/1015467.1015508"},{"key":"9321_CR9","doi-asserted-by":"crossref","unstructured":"Stevens W (1997) TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. RFC 2001, Internet Engineering Task Force","DOI":"10.17487\/rfc2001"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9321-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9321-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9321-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9321-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,22]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9321-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,22]]}}}