Výsledky vyhledávání - almost-linear time algorithms

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow Autor Brand, Jan Van Den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron

“…We give a deterministic m^{1+o(1)} time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities…”
Získat plný text

Almost-linear time decoding algorithm for topological codes Autor Delfosse, Nicolas, Nickerson, Naomi H.

“… We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure…”
Získat plný text

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality Autor Van Den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P., Meierhans, Simon, Gutenberg, Maximilian Probst, Sachdeva, Sushant

“…We give the first almost-linear total time algorithm for deciding if a flow of cost at most F still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e…”
Získat plný text

An almost linear time algorithm testing whether the Markoff graph modulo p is connected Autor Brown, Colby Austin

“… ] to test whether the Markoff graph modulo p is connected for arbitrary primes. Our algorithm runs in o ( p 1 + ϵ ) time for every ϵ > 0…”
Získat plný text

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three Autor Frieze, Alan, Haber, Simi

“…We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G=Gn,mδ≥3…”
Získat plný text

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time Autor Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant

“… This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, p-norm flows, and p-norm isotonic…”
Získat plný text

An almost linear time algorithm for field splitting in radiation therapy Autor Wu, Xiaodong, Dou, Xin, Bayouth, John E., Buatti, John M.

“… We develop a close-to-linear time algorithm for solving the field splitting problem while minimizing the total complexity of the resulting sub-IMs, thus improving the treatment delivery efficiency…”
Získat plný text

Sparsification, Online Optimization, and an Almost-Linear Time Algorithm for Maximum Flow Autor Liu, Yang

“… By combining new techniques developed in this thesis pertaining to iterative methods, dynamic algorithms, and high-dimensional geometry, we give an almost-linear-time algorithm that computes an exact…”
Získat plný text

Almost Linear Time Algorithms for Problems of Computational Genomics Autor Kamath, Govinda Mangalore

“…In this thesis we discuss designing fast algorithms for three problems in computational genomics.1. Genome Assembly…”
Získat plný text

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem Autor Galil, Zvi, Margalit, Oded

“… The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \ell )$, where $\ell…”
Získat plný text

An almost linear time algorithm for a general haplotype solution on tree pedigrees with no recombination and its extensions Autor Li, Xin, Li, Jing

“… On a tree pedigree without missing data, our algorithm can output a general solution as well as the number of total specific solutions in a nearly linear time O(mn . alpha(n…”
Zjistit podrobnosti o přístupu

Deterministic Small Vertex Connectivity in Almost Linear Time Autor Saranurak, Thatchaphol, Yingchareonthawornchai, Sorrachai

“… to break the quadratic-time barrier and, very recently, culminated in an almost-linear time algorithm via the recently announced maxflow algorithm by Chen et al…”
Získat plný text

Derandomizing Directed Random Walks in Almost-Linear Time Autor Kyng, Rasmus, Meierhans, Simon, Probst, Maximilian

“… Previous reductions imply the first deterministic almost-linear time algorithms for computing various fundamental quantities on directed graphs including stationary distributions, personalized…”
Získat plný text

Minor Containment and Disjoint Paths in Almost-Linear Time Autor Korhonen, Tuukka, Pilipczuk, Michal, Stamoulis, Giannos

“…We give an algorithm that, given graphs G and H , tests whether H is a minor of G in time \mathcal{O}_{H}(\overline{n}^{1+o(1…”
Získat plný text

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality Autor van den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P, Meierhans, Simon, Maximilian Probst Gutenberg, Sachdeva, Sushant

“…We give the first almost-linear total time algorithm for deciding if a flow of cost at most \(F…”
Získat plný text

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width Autor Ducoffe, Guillaume

“… Our first contribution is an almost linear-time algorithm to compute a maximum matching in any bounded clique-width graph, being given a corresponding clique-width expression…”
Získat plný text

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time Autor Bernstein, Aaron, Gutenberg, Maximilian Probst, Saranurak, Thatchaphol

“…], which leads to our second result: the first almost-linear time algorithm for (1 - E) -approximate min-cost flow in undirected graphs where capacities and costs can be taken over edges and vertices…”
Získat plný text

An almost linear-time algorithm for trapezoidation of GIS polygons Autor Lorenzetto, Gian Paolo, Datta, Amitava

“…). Trapezoidation is often performed as a first step to triangulation. There is a complex linear-time algorithm [Discrete Comput. Geom. 6 (1991) 485…”
Získat plný text

An almost linear time algorithm testing whether the Markoff graph modulo \(p\) is connected Autor Colby Austin Brown

“…] to test whether the Markoff graph modulo \(p\) is connected for arbitrary primes. Our algorithm runs in \(o(p^{1 + \epsilon})\) time for every \(\epsilon > 0…”
Získat plný text

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow Autor van den Brand, Jan, Chen, Li, Kyng, Rasmus, Liu, Yang P, Peng, Richard, Maximilian Probst Gutenberg, Sachdeva, Sushant, Sidford, Aaron

“…We give a deterministic \(m^{1+o(1)}\) time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with \(m…”
Získat plný text