{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T07:14:34Z","timestamp":1717917274839},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["1029711","IIS-1320580"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"USDOD","award":["HM0210-13-1-0005","OVPR U-Spatial"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,11,1]]},"DOI":"10.1109\/tkde.2015.2445756","type":"journal-article","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T18:38:32Z","timestamp":1434393512000},"page":"2919-2932","source":"Crossref","is-referenced-by-count":13,"title":["Capacity-Constrained Network-Voronoi Diagram"],"prefix":"10.1109","volume":"27","author":[{"given":"KwangSoo","family":"Yang","sequence":"first","affiliation":[]},{"given":"Apurv Hirsh","family":"Shekhar","sequence":"additional","affiliation":[]},{"given":"Dev","family":"Oliver","sequence":"additional","affiliation":[]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/13658810701587891"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L"},{"key":"ref10","volume":"173","author":"diestel","year":"2005","journal-title":"Graph Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2006-00046-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"ref14","first-page":"88","article-title":"The LCA problem revisited","author":"bender","year":"0","journal-title":"Proceedings of the 4th Latin American Symposium on Theoretical Informatics"},{"key":"ref15","first-page":"258","article-title":"Nearest common ancestors: A survey and a new distributed algorithm","author":"alstrup","year":"0","journal-title":"Proc 14th Annu ACM Symp Parallel Algorithms Archit"},{"key":"ref16","first-page":"36","article-title":"Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE","author":"fischer","year":"0","journal-title":"Proc 17th Annu Conf Combinatorial Pattern Matching"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1195-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758773"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2012.719624"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"ref27","first-page":"1","article-title":"Evacuation route planning: Scalable heuristics","author":"kim","year":"0","journal-title":"Proc 15th Annu ACM Int Symp Adv Geographic Inf Syst"},{"key":"ref3","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.01.006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/9781119967101"},{"key":"ref5","article-title":"Partitioning into connected parts, (slide 7) in ‘graph partitioning problems’","author":"diwan","year":"2011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/9781118537015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40235-7_4"},{"key":"ref2","year":"0"},{"key":"ref9","author":"reza","year":"2009","journal-title":"Facility Location Concepts Models Algorithms and Case Studies"},{"key":"ref1","year":"2012"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54233-7_146"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref21","first-page":"9","article-title":"Dynamic graph algorithms","author":"demetrescu","year":"0","journal-title":"Algorithms and Theory of Computation Handbook"},{"key":"ref24","year":"0"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","author":"korte","year":"2012","journal-title":"Combinatorial Optimization"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/012","volume":"12","author":"johnson","year":"1993","journal-title":"Network flows and matching First DIMACS implementation challenge"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7289487\/07123646.pdf?arnumber=7123646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:03:14Z","timestamp":1642003394000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7123646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,1]]},"references-count":32,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2445756","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11,1]]}}}