Suchergebnisse - almost-linear time algorithms

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow von 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 …”
Volltext

Almost-linear time decoding algorithm for topological codes von 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 …”
Volltext

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality von 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 …”
Volltext

An almost linear time algorithm testing whether the Markoff graph modulo p is connected von 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 …”
Volltext

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three von 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 …”
Volltext

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time von 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 …”
Volltext

An almost linear time algorithm for field splitting in radiation therapy von 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 …”
Volltext

Sparsification, Online Optimization, and an Almost-Linear Time Algorithm for Maximum Flow von 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 …”
Volltext

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

“… In this thesis we discuss designing fast algorithms for three problems in computational genomics.1. Genome Assembly …”
Volltext

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem von 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 …”
Volltext

An almost linear time algorithm for a general haplotype solution on tree pedigrees with no recombination and its extensions von 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 …”
Weitere Angaben

Deterministic Small Vertex Connectivity in Almost Linear Time von 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 …”
Volltext

Derandomizing Directed Random Walks in Almost-Linear Time von 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 …”
Volltext

Minor Containment and Disjoint Paths in Almost-Linear Time von 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 …”
Volltext

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality von 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 …”
Volltext

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width von 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 …”
Volltext

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time von 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 …”
Volltext

An almost linear-time algorithm for trapezoidation of GIS polygons von 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 …”
Volltext

An almost linear time algorithm testing whether the Markoff graph modulo \(p\) is connected von 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 …”
Volltext

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow von 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 …”
Volltext