Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that  may support insertions and deletions of edges in G as ll as distance queries beten 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 O(n2/3) time, based on ideas of a seminal paper by Fakcharoenphol and Rao [FOCS'01]. A (1+e)-approximation algorithm of Abraham et al. [STOC'12] performs updates and queries in O(√n) time. An algorithm with a more practical O(polylog(n)) runtime would be a major breakthrough. Hover, such runtimes are only known for a (1+e)-approximation in a model where only restricted ight updates are allod due to Abraham et al. [SODA'16], or for easier problems like connectivity. ,  follow a recent and very active line of work on showing lor bounds for polynomial time problems based on popular conjectures, obtaining the first such results for natural problems in planar graphs. Such results re previously out of reach due to the highly non-planar nature of known reductions and the impossibility of "planarizing gadgets".  introduce a new framework which is inspired by techniques from the literatures on distance labelling schemes and on parameterized complexity. Using our framework,  show that no algorithm for dynamic shortest paths or maximum ight bipartite matching in planar graphs can support both updates and queries in amortized O(n1/2-e) time, for any e>0, unless the classical all-pairs-shortest-paths problem can be solved in truly subcubic time, which is widely believed to be impossible.  extend these results to obtain strong lor bounds for other related problems as ll as for possible trade-offs beten query and update time. Interestingly, our lor bounds hold even in very restrictive models where only ight updates are allod.
['Amir Abboud', 'Søren Dahlgaard']
I am writing a research paper on a idea Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
[{"from": "human", "value": "I am writing a research paper on a idea Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that  may support insertions and deletions of edges in G as ll as distance queries beten 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 O(n2/3) time, based on ideas of a seminal paper by Fakcharoenphol and Rao [FOCS'01]. A (1+e)-approximation algorithm of Abraham et al. [STOC'12] performs updates and queries in O(\u221an) time. An algorithm with a more practical O(polylog(n)) runtime would be a major breakthrough. Hover, such runtimes are only known for a (1+e)-approximation in a model where only restricted ight updates are allod due to Abraham et al. [SODA'16], or for easier problems like connectivity. ,  follow a recent and very active line of work on showing lor bounds for polynomial time problems based on popular conjectures, obtaining the first such results for natural problems in planar graphs. Such results re previously out of reach due to the highly non-planar nature of known reductions and the impossibility of \"planarizing gadgets\".  introduce a new framework which is inspired by techniques from the literatures on distance labelling schemes and on parameterized complexity. Using our framework,  show that no algorithm for dynamic shortest paths or maximum ight bipartite matching in planar graphs can support both updates and queries in amortized O(n1/2-e) time, for any e>0, unless the classical all-pairs-shortest-paths problem can be solved in truly subcubic time, which is widely believed to be impossible.  extend these results to obtain strong lor bounds for other related problems as ll as for possible trade-offs beten query and update time. Interestingly, our lor bounds hold even in very restrictive models where only ight updates are allod."}]