Search Results - Near-Linear Time Algorithm*

Vizing’s Theorem in Near-Linear Time

Authors: Sepehr Assadi Soheil Behnezhad Sayan Bhattacharya et al.

Contributors: Sepehr Assadi Soheil Behnezhad Sayan Bhattacharya et al.

Source: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing

Subject Terms: FOS: Computer and information sciences, Vizing's Theorem, Edge Coloring, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

File Description: application/application/pdf

Access URL: http://arxiv.org/abs/2410.05240
http://hdl.handle.net/20.500.11850/745266

A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes

Authors: Bin Cao Chao Xu

Source: Annals of Operations Research. 344:479-498

Negative-Weight Single-Source Shortest Paths in Near-linear Time.

Authors: Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian

Source: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-34. 34p.

Subject Terms: *ALGORITHMS, GRAPH algorithms, GRAPH theory, COMPUTATIONAL complexity

A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon

Authors: van der Horst, Thijs van Kreveld, Marc Ophelders, Tim et al.

Contributors: van der Horst, Thijs van Kreveld, Marc Ophelders, Tim et al.

Subject Terms: simple polygon, ddc:004, geodesic, Fréchet distance

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.37

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time

Authors: Nick Fischer Leo Wennmann Nick Fischer and Leo Wennmann

Contributors: Nick Fischer Leo Wennmann Nick Fischer and Leo Wennmann

Source: TheoretiCS. 4

Subject Terms: FOS: Computer and information sciences, Fine-Grained Complexity, Data Structures and Algorithms, Scheduling, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic Strings

File Description: application/pdf

Access URL: http://arxiv.org/abs/2402.13357
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.64

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon

Authors: van der Horst, Thijs van Kreveld, Marc Ophelders, Tim et al.

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Geometry, F.2.2

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

Ortho-Radial Drawing in Near-Linear Time: Ortho-radial drawing in near-linear time

Authors: Yi-Jun Chang

Contributors: Yi-Jun Chang

Source: TheoretiCS. 4

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computing methodologies and applications, Graph drawing, Graph theory, graph drawing, topology-shape-metric framework, Discrete mathematics in relation to computer science, ortho-radial drawing, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2305.00425
https://zbmath.org/8036758
https://doi.org/10.46298/theoretics.25.11
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.35

Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding

Authors: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Contributors: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Source: SIAM Journal on Discrete Mathematics. 34:2282-2299

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, ddc:004, Near-Linear Time Algorithm, 01 natural sciences, n-fold ILP, Color Coding

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2019/10651/pdf/LIPIcs-ICALP-2019-75.pdf
http://arxiv.org/abs/1811.00950
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-00950
https://epubs.siam.org/doi/abs/10.1137/19M1303873
https://dblp.uni-trier.de/db/conf/icalp/icalp2019.html#JansenLR19
https://drops.dagstuhl.de/opus/volltexte/2019/10651/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.75

Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework.

Authors: Paweł Górecki Alexey Markin Sriram Vijendran et al.

Source: PLoS Computational Biology, Vol 21, Iss 6, p e1013069 (2025)

Subject Terms: Biology (General), QH301-705.5

File Description: electronic resource

Relation: https://doaj.org/toc/1553-734X; https://doaj.org/toc/1553-7358

Access URL: https://doaj.org/article/6de59d3af369443b86e38ac853d144e5

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering

Authors: Cohen(-)Addad, Vincent D'Orsi, Tommaso Mousavifar, Aida

Subject Terms: FOS: Computer and information sciences, CLUSTERING, SEMIRANDOM MODELS, FINE-GRAINED COMPLEXITY, MATRIX MULTPLICATIVE WEIGHTS, BALANCED CUT, SPARSEST CUT, Computer Science - Machine Learning, F.2, G.3, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Machine Learning (cs.LG)

Access URL: http://arxiv.org/abs/2406.04857
https://proceedings.mlr.press/v235/cohen-addad24c.html
https://hdl.handle.net/11565/4070017

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones

Authors: Chandran, L. Sunil Gajjala, Rishikesh Mehra, Shravan et al.

Contributors: Chandran, L. Sunil Gajjala, Rishikesh Mehra, Shravan et al.

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Robotics, Scheduling, Fine-grained complexity, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, Robotics (cs.RO), Approximation algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.16323
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.17

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time

Authors: Dhawan, Abhishek

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

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

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering

Authors: Cohen-Addad, Vincent d'Orsi, Tommaso Mousavifar, Aida

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning, F.2, G.3, text

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

Extending Partial Representations of Circle Graphs in Near-Linear Time

Authors: Guido Brückner Ignaz Rutter Peter Stumpf et al.

Contributors: Guido Brückner Ignaz Rutter Peter Stumpf et al.

Source: Algorithmica, 86, 2152–2173

Subject Terms: ddc:004, DATA processing & computer science, split decomposition tree, 0102 computer and information sciences, 01 natural sciences, Simultaneous representation, recognition algorithm, Recognition, Geometric intersection graphs, Circle graphs, circle graphs, partial representation extension, 0101 mathematics

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.25
https://publikationen.bibliothek.kit.edu/1000170059/152665911
https://publikationen.bibliothek.kit.edu/1000170059
https://doi.org/10.5445/IR/1000170059
https://publikationen.bibliothek.kit.edu/1000151221/149398001
https://publikationen.bibliothek.kit.edu/1000151221
https://doi.org/10.5445/IR/1000151221

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

Authors: Bringmann, Karl Cassis, Alejandro Fischer, Nick

Source: IEEE 64th Annual Symposium on Foundations of Computer Science
64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2304.05279
http://hdl.handle.net/21.11116/0000-000E-7585-8
http://hdl.handle.net/21.11116/0000-000E-758B-2

Deterministic Longest Common Subsequence Approximation in Near-Linear Time

Authors: Boneh, Itai Golan, Shay Kraus, Matan

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

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

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time

Authors: Srivastava, Shashank Tulsiani, Madhur

Subject Terms: FOS: Computer and information sciences, Computational Complexity, Data Structures and Algorithms, Information Theory (cs.IT), Information Theory, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

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

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance

Authors: Driemel, Anne Höckendorff, Jan Psarros, Ioannis et al.

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

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

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space

Authors: Sajith, Thejas Radhika

Subject Terms: FOS: Computer and information sciences, Computational Complexity, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

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

Optimal Pure Differentially Private Sparse Histograms in Near-Linear Deterministic Time

Authors: Kerschbaum, Florian Lee, Steven Wu, Hao

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Cryptography and Security, Data Structures and Algorithms (cs.DS), Cryptography and Security (cs.CR)

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