{"id":"https://openalex.org/W2927603346","doi":"https://doi.org/10.20382/jocg.v11i2a11","title":"Preconditioning for the Geometric Transportation Problem","display_name":"Preconditioning for the Geometric Transportation Problem","publication_year":2021,"publication_date":"2021-03-06","ids":{"openalex":"https://openalex.org/W2927603346","doi":"https://doi.org/10.20382/jocg.v11i2a11","mag":"2927603346"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3130","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3130","pdf_url":"https://jocg.org/index.php/jocg/article/view/3130","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019; 234\u2013259","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/3130","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044789301","display_name":"Andrey Boris Khesin","orcid":"https://orcid.org/0000-0002-8620-4092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khesin, Andrey Boris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053901790","display_name":"Aleksandar Nikolov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolov, Aleksandar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114050387","display_name":"Dmitry Paramonov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paramonov, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3044,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58001818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"11","issue":"2","first_page":"234\u2013259","last_page":"234\u2013259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9764000177383423,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9217000007629395,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6920075416564941},{"id":"https://openalex.org/keywords/transportation-theory","display_name":"Transportation theory","score":0.6042338013648987},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5845060348510742},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5777738690376282},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5718130469322205},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5427780747413635},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5162699222564697},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4884418547153473},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4804341793060303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4685802161693573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43741652369499207},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.4262336492538452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3733091950416565},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.27470409870147705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2248719334602356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2135421335697174},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.20266932249069214},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11840933561325073}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6920075416564941},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.6042338013648987},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5845060348510742},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5777738690376282},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5718130469322205},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5427780747413635},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5162699222564697},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4884418547153473},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4804341793060303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4685802161693573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43741652369499207},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.4262336492538452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3733091950416565},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27470409870147705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2248719334602356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2135421335697174},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.20266932249069214},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11840933561325073},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/3130","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3130","pdf_url":"https://jocg.org/index.php/jocg/article/view/3130","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019; 234\u2013259","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:af2b91dc8a5149d78f6dd43712b66c8c","is_oa":true,"landing_page_url":"https://doaj.org/article/af2b91dc8a5149d78f6dd43712b66c8c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 11, Iss 2 (2021)","raw_type":"article"},{"id":"mag:2927603346","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1902.08384","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.20382/jocg.v11i2a11","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v11i2a11","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3130","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3130","pdf_url":"https://jocg.org/index.php/jocg/article/view/3130","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019; 234\u2013259","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4252799795","display_name":"RCN: DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization","funder_award_id":"1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8196236912","display_name":null,"funder_award_id":"CCF-1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322015","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2927603346.pdf","grobid_xml":"https://content.openalex.org/works/W2927603346.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3092889289","https://openalex.org/W3152988225","https://openalex.org/W2510957839","https://openalex.org/W2962995556","https://openalex.org/W2019036002","https://openalex.org/W2521482842","https://openalex.org/W3163968926","https://openalex.org/W2109501666","https://openalex.org/W1579400793","https://openalex.org/W2042090128","https://openalex.org/W2034112563","https://openalex.org/W2896476941","https://openalex.org/W3011677699","https://openalex.org/W3030086609","https://openalex.org/W2889144877","https://openalex.org/W2177754880","https://openalex.org/W242681192","https://openalex.org/W2017756611","https://openalex.org/W12655715","https://openalex.org/W3118725616"],"abstract_inverted_index":{"$\\newcommand{\\eps}{\\varepsilon}$In":[0],"the":[1,38,42,76,106,109,115,120,134,153],"geometric":[2,77,148],"transportation":[3,34,78,93],"problem,":[4],"we":[5,71],"are":[6],"given":[7,21],"a":[8,22,33,91,156,162,169],"collection":[9],"of":[10,55,108,138],"points":[11],"$P$":[12],"in":[13,52,95,98,102,105,143],"$d$-dimensional":[14],"Euclidean":[15],"space,":[16],"and":[17,65,100,104,165],"each":[18],"point":[19],"is":[20,30,114,141],"(positive":[23],"or":[24],"negative":[25],"integer)":[26],"supply.":[27,112],"The":[28],"goal":[29],"to":[31,61,150,155,167],"find":[32],"map":[35,94],"that":[36],"satisfies":[37],"supplies,":[39],"while":[40],"minimizing":[41],"total":[43,110],"distance":[44],"traveled.":[45],"This":[46,113],"problem":[47,121,154,160],"has":[48],"been":[49],"widely":[50],"studied":[51],"many":[53],"fields":[54],"computer":[56,62],"science:":[57],"from":[58],"computational":[59],"geometry,":[60],"vision,":[63],"graphics,":[64],"machine":[66],"learning.":[67],"In":[68],"this":[69,173],"work":[70],"study":[72],"approximation":[73,117],"algorithms":[74],"for":[75,85,119,172],"problem.":[79,175],"We":[80],"give":[81],"an":[82],"algorithm":[83],"which,":[84],"any":[86],"fixed":[87],"dimension":[88],"$d$,":[89],"finds":[90],"$(1+\\eps)$-approximate":[92],"time":[96,124],"nearly-linear":[97],"$n$,":[99],"polynomial":[101],"$\\eps^{-1}$":[103],"logarithm":[107],"positive":[111],"first":[116,151],"scheme":[118],"whose":[122],"running":[123],"depends":[125],"on":[126,161],"$n$":[127],"as":[128],"$n\\cdot":[129],"\\mathrm{polylog}(n)$.":[130],"Our":[131],"techniques":[132],"combine":[133],"generalized":[135],"preconditioning":[136],"framework":[137],"Sherman,":[139],"which":[140],"grounded":[142],"continuous":[144],"optimization,":[145],"with":[146],"simple":[147],"arguments":[149],"reduce":[152],"minimum":[157],"cost":[158],"flow":[159],"sparse":[163],"graph,":[164],"then":[166],"design":[168],"good":[170],"preconditioner":[171],"latter":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}