Search Results - almost-linear time algorithms

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

Authors: van den Brand, Jan Chen, Li Kyng, Rasmus et al.

Source: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Maximum flow, Minimum cost flow, Data structures, Interior point methods, Convex optimization, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2407.10830
http://hdl.handle.net/20.500.11850/711146

Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)

Authors: Kyng, Rasmus Rasmus Kyng

Contributors: Kyng, Rasmus Rasmus Kyng

Subject Terms: interior point methods, continuous optimization, ddc:004, Graph algorithms and data strucures

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.3

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow

Authors: Li Chen Rasmus Kyng Yang P. Liu et al.

Source: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1165-1173

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2311.18295

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

Authors: Chen, Li Kyng, Rasmus Liu, Yang P. et al.

Source: Communications of the ACM, 66 (12)

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://hdl.handle.net/20.500.11850/643313

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

Authors: Brand, Jan van den Chen, Li Kyng, Rasmus et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2407.10830

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks

Authors: Yuya Higashikawa Koji Watase Junichi Teruyama et al.

Source: Lecture Notes in Computer Science ISBN: 9783030648428

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/pdf/2010.05729
http://arxiv.org/abs/2010.05729
https://rd.springer.com/chapter/10.1007/978-3-030-64843-5_14
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-05729
https://link.springer.com/chapter/10.1007/978-3-030-64843-5_14
https://dblp.uni-trier.de/db/journals/tcs/tcs873.html#HigashikawaKTW21
https://www.sciencedirect.com/science/article/pii/S0304397521002620

An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)

Authors: Kyng, Rasmus Rasmus Kyng

Contributors: Kyng, Rasmus Rasmus Kyng

Subject Terms: Data structures, Maximum flow, Minimum cost flow, Interior point methods, ddc:004, Convex optimization

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.2

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Authors: Chen, Li Kyng, Rasmus Liu, Yang et al.

Source: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-103, 103p

Subject Terms: DIRECTED acyclic graphs, DATA structures, INTERIOR-point methods, ISOTONIC regression, FLOWGRAPHS

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow

Authors: Chen, Li Kyng, Rasmus Liu, Yang P. et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2311.18295

An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)

Authors: Rasmus Kyng Kyng, Rasmus

Index Terms: Maximum flow, Minimum cost flow, Data structures, Interior point methods, Convex optimization, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.2
Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)

Derandomizing Directed Random Walks in Almost-Linear Time

Authors: Kyng, Rasmus Meierhans, Simon Probst Gutenberg, Maximilian

Source: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

Subject Terms: FOS: Computer and information sciences, Algorithms, Algorithm design and analysis, Derandomization, Directed Laplacians, Random Walks, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Access URL: http://arxiv.org/abs/2208.10959
http://hdl.handle.net/20.500.11850/623336

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

Authors: Li Chen Rasmus Kyng Yang Liu et al.

Source: Journal of the ACM, 72 (3)
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

Subject Terms: FOS: Computer and information sciences, convex optimization, interior point methods, Maximum flow, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, minimum-cost flow, data structures, Computer Science - Data Structures and Algorithms, Minimum cost flow, Data structures, Interior point methods, Convex optimization, Data Structures and Algorithms (cs.DS)

File Description: application/application/pdf

Access URL: http://arxiv.org/abs/2203.00671
http://hdl.handle.net/20.500.11850/742754
http://hdl.handle.net/20.500.11850/623333

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.

Authors: Li Chen Kyng, Rasmus Liu, Yang P. et al.

Source: Communications of the ACM; Dec2023, Vol. 66 Issue 12, p85-92, 8p

Subject Terms: ALGORITHMS, COMPUTER science, INTERIOR-point methods, LINEAR time invariant systems, MATHEMATICS theorems

Almost Linear Time Algorithms for Some Problems on Dynamic Flow Networks

Authors: Naoki Katoh Yuya Higashikawa Junichi Teruyama

Source: Sublinear Computation Paradigm ISBN: 9789811640940

Subject Terms: 11. Sustainability

Access URL: https://link.springer.com/content/pdf/10.1007%2F978-981-16-4095-7_5.pdf
https://link.springer.com/chapter/10.1007/978-981-16-4095-7_5
https://link.springer.com/content/pdf/10.1007%2F978-981-16-4095-7_5.pdf

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs

Authors: Peng, Richard Rao, Anup B. Sidford, Aaron et al.

Contributors: Peng, Richard Rao, Anup B. Sidford, Aaron et al.

Source: arXiv

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/pdf

Access URL: http://dl.acm.org/ft_gateway.cfm?id=3055463&type=pdf
http://arxiv.org/abs/1611.00755
https://arxiv.org/abs/1611.00755
https://dblp.uni-trier.de/db/journals/corr/corr1611.html#CohenKPPRSV16
https://dl.acm.org/doi/pdf/10.1145/3055399.3055463
http://ui.adsabs.harvard.edu/abs/2016arXiv161100755C/abstract
https://dspace.mit.edu/handle/1721.1/115991
https://orcid.org/0000-0002-7388-6936
https://orcid.org/0000-0002-6514-3761
https://orcid.org/0000-0003-0722-304X
https://orcid.org/0000-0002-4257-4198
http://hdl.handle.net/1721.1/115991

Clustering mixture models in almost-linear time via list-decodable mean estimation

Authors: Diakonikolas, Ilias Kane, Daniel M Kongsgaard, Daniel et al.

Source: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. :1262-1275

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, list-decodable learning, Applied Mathematics, Machine Learning (stat.ML), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Mathematical Sciences, Machine Learning (cs.LG), robust statistics, Statistics - Machine Learning, Information and Computing Sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), mixture models, clustering

Access URL: http://arxiv.org/abs/2106.08537
https://escholarship.org/uc/item/2pp4v56k

An Almost Linear-Time Algorithm for Graph Realization

Authors: Bixby, Robert E. Wagner, Donald K.

Source: Mathematics of Operations Research, 1988 Feb 01. 13(1), 99-123.

Access URL: https://www.jstor.org/stable/3689867

Almost Linear Time Algorithms for Minsum $k$-Sink Problems on Dynamic Flow Path Networks

Authors: Higashikawa, Yuya Katoh, Naoki Teruyama, Junichi et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2010.05729

Vizing's Theorem in Deterministic Almost-Linear Time

Authors: Assadi, Sepehr Behnezhad, Soheil Bhattacharya, Sayan et al.

Subject Terms: Data Structures and Algorithms

Relation: http://arxiv.org/abs/2510.12619

Availability: http://arxiv.org/abs/2510.12619

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks.

Authors: Higashikawa, Yuya Katoh, Naoki Teruyama, Junichi et al.

Source: Theoretical Computer Science. Jun2021, Vol. 873, p87-113. 27p.

Subject Terms: *POLYNOMIAL time algorithms, *ALGORITHMS, *DATA structures, *COMPUTER science, *UNITS of time