Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as well as distance queries between any two nodes u, v subject to the constraint that the graph remains planar at all times. This problem has bee...
Uloženo v:
| Vydáno v: | Annual Symposium on Foundations of Computer Science s. 477 - 486 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.10.2016
|
| Témata: | |
| ISSN: | 0272-5428 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as well as distance queries between any two nodes u, v subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades. The best known algorithm performs queries and updates in Õ(n2/3) time, based on ideas of a seminal paper by Fakcharoenphol and Rao [FOCS'01]. A (1+ε)-approximation algorithm of Abraham et al. [STOC'12] performs updates and queries in Õ(√n) time. An algorithm with a more practical O(polylog(n)) runtime would be a major breakthrough. However, such runtimes are only known for a (1+ε)-approximation in a model where only restricted weight updates are allowed due to Abraham et al. [SODA'16], or for easier problems like connectivity. In this paper, we follow a recent and very active line of work on showing lower bounds for polynomial time problems based on popular conjectures, obtaining the first such results for natural problems in planar graphs. Such results were previously out of reach due to the highly non-planar nature of known reductions and the impossibility of "planarizing gadgets". We introduce a new framework which is inspired by techniques from the literatures on distance labelling schemes and on parameterized complexity. Using our framework, we show that no algorithm for dynamic shortest paths or maximum weight bipartite matching in planar graphs can support both updates and queries in amortized O(n1/2-ε) time, for any ε>0, unless the classical all-pairs-shortest-paths problem can be solved in truly subcubic time, which is widely believed to be impossible. We extend these results to obtain strong lower bounds for other related problems as well as for possible trade-offs between query and update time. Interestingly, our lower bounds hold even in very restrictive models where only weight updates are allowed. |
|---|---|
| AbstractList | The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as well as distance queries between any two nodes u, v subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades. The best known algorithm performs queries and updates in Õ(n2/3) time, based on ideas of a seminal paper by Fakcharoenphol and Rao [FOCS'01]. A (1+ε)-approximation algorithm of Abraham et al. [STOC'12] performs updates and queries in Õ(√n) time. An algorithm with a more practical O(polylog(n)) runtime would be a major breakthrough. However, such runtimes are only known for a (1+ε)-approximation in a model where only restricted weight updates are allowed due to Abraham et al. [SODA'16], or for easier problems like connectivity. In this paper, we follow a recent and very active line of work on showing lower bounds for polynomial time problems based on popular conjectures, obtaining the first such results for natural problems in planar graphs. Such results were previously out of reach due to the highly non-planar nature of known reductions and the impossibility of "planarizing gadgets". We introduce a new framework which is inspired by techniques from the literatures on distance labelling schemes and on parameterized complexity. Using our framework, we show that no algorithm for dynamic shortest paths or maximum weight bipartite matching in planar graphs can support both updates and queries in amortized O(n1/2-ε) time, for any ε>0, unless the classical all-pairs-shortest-paths problem can be solved in truly subcubic time, which is widely believed to be impossible. We extend these results to obtain strong lower bounds for other related problems as well as for possible trade-offs between query and update time. Interestingly, our lower bounds hold even in very restrictive models where only weight updates are allowed. |
| Author | Abboud, Amir Dahlgaard, Soren |
| Author_xml | – sequence: 1 givenname: Amir surname: Abboud fullname: Abboud, Amir email: abboud@cs.stanford.edu organization: Dept. of Comput. Sci., Stanford Univ., Stanford, CA, USA – sequence: 2 givenname: Soren surname: Dahlgaard fullname: Dahlgaard, Soren email: soerend@di.ku.dk organization: Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark |
| BookMark | eNotjMtKw0AYRkeoYFu7c-dmXiBx7pdlTW0VCi2o6zIz-cem5MYkXfTtDSh8cBbn8C3QrO1aQOiJkpxSYl-2h-IzZ4SqXJo7tLLaUEks4ZZzPkNzwjTLpGDmAS2G4UKIIJLwOdocu_5au4SLrr1AGK8JBuym4VeXUgUJxy7hza11TRXwsXbt1O6S6894Xf90qRrPzfCI7qOrB1j9c4m-t29fxXu2P-w-ivU-q6iWYxYVLbnVXDquXYQQQumDESaUlkctIRrvDUTvldGinIwiJgoBUZbEKx75Ej3__VYAcOpT1bh0O2ltmFWM_wICz0ye |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/FOCS.2016.58 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISBN | 9781509039333 1509039333 |
| EndPage | 486 |
| ExternalDocumentID | 7782962 |
| Genre | orig-research |
| GroupedDBID | -~X 23M 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ACNCT ADZIZ AFFNX AI. ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IPLJI OCL RIE RIL RIO RNS VH1 |
| ID | FETCH-LOGICAL-i175t-f61d39735a37afecccdbc848cd93f75ef8bb8efbb6874dc84608f44ef5d0b63f3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 56 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000391198500051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0272-5428 |
| IngestDate | Wed Aug 27 01:57:35 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-f61d39735a37afecccdbc848cd93f75ef8bb8efbb6874dc84608f44ef5d0b63f3 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_7782962 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-Oct. |
| PublicationDateYYYYMMDD | 2016-10-01 |
| PublicationDate_xml | – month: 10 year: 2016 text: 2016-Oct. |
| PublicationDecade | 2010 |
| PublicationTitle | Annual Symposium on Foundations of Computer Science |
| PublicationTitleAbbrev | SFCS |
| PublicationYear | 2016 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040503 |
| Score | 1.9935265 |
| Snippet | The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 477 |
| SubjectTerms | all pairs shortest paths Complexity theory Computer science conditional lower bounds dynamic distance oracles hardness in p Heuristic algorithms Labeling planar graphs Roads Runtime Shortest path problem |
| Title | Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms |
| URI | https://ieeexplore.ieee.org/document/7782962 |
| WOSCitedRecordID | wos000391198500051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VigGWQlvEtzwwkn7Eru2M0FIYoFQCpG6VndjQClqUpPx-zk4bGFiQMkRJdJF8tu_ZvnsP4KIrtOEsFjjEsQczkZhA4zIsUAZ7iwPwyngS13sxGsnJJBpX4LKshTHG-OQz03K3_iw_WcYrt1XWFhjOIjfhbgnBi1qtzazLHK-J308Rjts_lGWSe9QePvafXBIXbzlh918iKj6GDGv_-_seNH-K8ci4DDP7UDGLOtQ2agxkPTjrsPtQMrBmDRiMvTJXStDKvDgnyIjCi1yr1KnUEUSrZFDo0RMnXYTf3jr2anL1_rpMZ_nbR9aEl-HNc_8uWCsmBDOEAXlgeTdBgEF7igpl0TtxomPJZJxE1IqesVJraazWXAqW4BvekZYxY3tJR3Nq6QFUF8uFOQRCQ2m14h0bCgeyLBrguGhlEUWLoZVH0HBNNP0sSDGm69Y5_vvxCew4BxRZcKdQzdOVOYPt-CufZem59-Q3GOuesA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4haKJeUMD42x48Ohhb13ZHBREjIImYcCPr1iJGwWzDv9_XDaYHLyY7LNvylvS1fV_b974P4KrFpWI05DjEsQdTHilL4jLMChT2FgPgA5WRuPb5cCgmE39UguuiFkYplSWfqYa5zc7yo2W4MltlTY7hzDcT7pZHqWPn1VqbeZcaZpNsR4Ubdn9HFGnufrP71H42aVysYaTdf8moZFGkW_nf__eh_lOOR0ZFoDmAklpUobLRYyDr4VmFvUHBwZrUoDPKtLliglbe8pOChAR4kdsgNjp1BPEq6eSK9MSIF-G394a_mty8z5bxPH39SOrw0r0bt3vWWjPBmiMQSC3NWhFCDNcLXB5o9E8YyVBQEUa-q7mntJBSKC0lE5xG-IbZQlOqtBfZkrnaPYTyYrlQR0BcR2gZMFs73MAsjQYYLlup76JFR4tjqJkmmn7mtBjTdeuc_P34EnZ640F_2n8YPp7CrnFGnhN3BuU0Xqlz2A6_0nkSX2Re_QaJq6H3 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Popular+Conjectures+as+a+Barrier+for+Dynamic+Planar+Graph+Algorithms&rft.au=Abboud%2C+Amir&rft.au=Dahlgaard%2C+Soren&rft.date=2016-10-01&rft.pub=IEEE&rft.issn=0272-5428&rft.spage=477&rft.epage=486&rft_id=info:doi/10.1109%2FFOCS.2016.58&rft.externalDocID=7782962 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon |