Zobrazeno 1 - 10
of 231
pro vyhledávání: '"dynamic graph algorithms"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Goranci, Gramoz, Henzinger, Monika
We show an (1+ε)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m^{1/2+o(1)} ε^{-1/2} amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5360e76c66db0d8e100b9d224d66391
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5745a0fd32557344ffaa2ca59c6b0725
http://arxiv.org/abs/2305.00122
http://arxiv.org/abs/2305.00122
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for general dyna
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24b41e99631d97ef520bc73e62445ccf
http://arxiv.org/abs/2208.07572
http://arxiv.org/abs/2208.07572
In this work, we investigate the analysis of generators for dynamic graphs, which are defined as graphs whose topology changes over time. We focus on generated graphs whose orders are neither growing nor constant along time. We introduce a novel conc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0a42b739357a3d00a8ff95223aa6e5b
http://arxiv.org/abs/2301.09458
http://arxiv.org/abs/2301.09458
Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c64c4779bf3854a20cb475ea9207cca
The paper resolves a long-standing open question in network dynamics. Averaging-based consensus has long been known to exhibit an exponential gap in relaxation time between the connected and disconnected cases, but a satisfactory explanation has rema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33dffe69dd8a104e169d1c9eb01b64b3
In the shortest path interdiction problem, an interdictor aims to remove arcs of total cost at most a given budget from a directed graph with given arc costs and traversal times such that the length of a shortest s-t-path is maximized. For static gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4a18ded8d5be9b705c9a0029d8e25a5
Autor:
Kyng, Rasmus
In this talk, I will explain a new algorithm for computing exact maximum and minimum-cost flows in almost-linear time, settling the time complexity of these basic graph problems up to subpolynomial factors. Our algorithm uses a novel interior point m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b1b1e9b45857b73ebb0fdac197ba854
Autor:
Bernstein, Aaron, Chechik, Shiri, Forster, Sebastian, Kopelowitz, Tsvi, Nazari, Yasamin, Wein, Nicole
This report documents the program and the outcomes of Dagstuhl Seminar 22461 “Dynamic Graph Algorithms”, which took place from November 13 to November 18, 2022. The field of dynamic graph algorithms studies algorithms for processing graphs that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a338248c1c9d7c9904f5027ba933b620