{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:15:55Z","timestamp":1730222155877,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/focs.2011.73","type":"proceedings-article","created":{"date-parts":[[2011,12,23]],"date-time":"2011-12-23T11:39:51Z","timestamp":1324640391000},"page":"170-179","source":"Crossref","is-referenced-by-count":31,"title":["Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time"],"prefix":"10.1109","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[]},{"given":"Philip N.","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Shay","family":"Mozes","sequence":"additional","affiliation":[]},{"given":"Yahav","family":"Nussbaum","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Wulff-Nilsen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9436-7"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"18","first-page":"898","article-title":"Using divide and conquer to find flows in directed planar networks in O(n3\/2 log n) time","author":"johnson","year":"0","journal-title":"Proc of the 20th Annual Allerton Conf on Communication Control and Computing 1982"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0524"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993679"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502093"},{"key":"11","first-page":"271","article-title":"Exact maximum a posteriori estimation for binary images","volume":"51","author":"greig","year":"1989","journal-title":"J Roy Stat Soc B"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/0406038"},{"journal-title":"Finding the Maximal Empty Rectangle Containing A Query Point","year":"2011","author":"kaplan","key":"20"},{"key":"22","first-page":"146","article-title":"Multiple-source shortest paths in planar graphs","author":"klein","year":"2005","journal-title":"16th SODA"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009223"},{"key":"24","article-title":"Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields","author":"kleinberg","year":"1999","journal-title":"45th FOCS"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90030-9"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789162997"},{"key":"27","first-page":"206","article-title":"Shortest paths in planar graphs with real lengths in O(n log2 n= log log n) time","author":"mozes","year":"2010","journal-title":"17th ESA"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206863"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502798"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00338-9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.007"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.65"},{"key":"5","first-page":"89","article-title":"Multiple source shortest paths in a genus g graph","author":"cabello","year":"2007","journal-title":"16th SODA"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"}],"event":{"name":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2011,10,22]]},"location":"Palm Springs, CA, USA","end":{"date-parts":[[2011,10,25]]}},"container-title":["2011 IEEE 52nd Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6108120\/6108130\/06108162.pdf?arnumber=6108162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T13:36:16Z","timestamp":1490103376000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6108162\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/focs.2011.73","relation":{},"subject":[],"published":{"date-parts":[[2011,10]]}}}