Výsledky vyhľadávania - Near-Linear Time Algorithm

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

Autori: Bin Cao Chao Xu

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

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

Autori: Klaus Jansen Alexandra Lassota Lars Rohwedder a ďalší

Prispievatelia: Klaus Jansen Alexandra Lassota Lars Rohwedder a ďalší

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

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

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

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

Predmety: 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)

Prístupová URL adresa: 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

Autori: Chandran, L. Sunil Gajjala, Rishikesh Mehra, Shravan a ďalší

Prispievatelia: Chandran, L. Sunil Gajjala, Rishikesh Mehra, Shravan a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Dhawan, Abhishek

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

Prístupová URL adresa: http://arxiv.org/abs/2407.16585

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

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

Témy: Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning, F.2, G.3, text

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

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

Autori: Bringmann, Karl Cassis, Alejandro Fischer, Nick

Zdroj: 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)

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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Extending Partial Representations of Circle Graphs in Near-Linear Time

Autori: Guido Brückner Ignaz Rutter Peter Stumpf a ďalší

Prispievatelia: Guido Brückner Ignaz Rutter Peter Stumpf a ďalší

Zdroj: Algorithmica, 86, 2152–2173

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

A Near-Linear Time Algorithm for the Chamfer Distance

Autori: Bakshi, Ainesh Indyk, Piotr Jayaram, Rajesh a ďalší

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Graphics, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Graphics (cs.GR), Machine Learning (cs.LG)

Prístupová URL adresa: http://arxiv.org/abs/2307.03043

Algorithm Engineering of SSSP With Negative Edge Weights

Autori: Cassis, Alejandro Karrenbauer, Andreas Nusser, André a ďalší

Prispievatelia: Cassis, Alejandro Karrenbauer, Andreas Nusser, André a ďalší

Predmety: FOS: Computer and information sciences, 2012 ACM Subject Classification Theory of computation → Shortest paths Single Source Shortest Paths Negative Weights Near-Linear Time Digital Object Identifier 10.4230/LIPIcs.SEA.2025.10, Theory of computation → Shortest paths, Single Source Shortest Paths, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Near-Linear Time, [INFO] Computer Science [cs], Negative Weights, Near-Linear Time Digital Object Identifier 10.4230/LIPIcs.SEA.2025.10, 2012 ACM Subject Classification Theory of computation → Shortest paths Single Source Shortest Paths

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2502.11999
https://hal.science/hal-05316595v1
https://doi.org/10.4230/lipics.sea.2025.10
https://hal.science/hal-05316595v1/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.10

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

Autori: Cao, Bin Xu, Chao

Zdroj: Annals of Operations Research; Jan2025, Vol. 344 Issue 1, p479-498, 20p

Predmety: POLYNOMIAL time algorithms, TIME complexity, LINEAR programming, SCHEDULING, ALGORITHMS

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs

Autori: Henzinger, Monika Li, Jason Rao, Satish a ďalší

Zdroj: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Predmety: Computer Science - Data Structures and Algorithms

Prístupová URL adresa: http://arxiv.org/abs/2401.05627

Distributed exact weighted all-pairs shortest paths in randomized near-linear time

Autori: Bernstein, Aaron Na Nongkai, Danupon

Zdroj: SIAM journal on computing (Print). 52(2):112-127

Predmety: all-pairs shortest paths, CONGEST, distributed algorithms, graph algorithms

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-331552

Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory

Autori: Jambulapati, Arun Reis, Victor Tian, Kevin

Zdroj: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912

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

Prístupová URL adresa: http://arxiv.org/abs/2305.08434

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Autori: Forster, Sebastian Nanongkai, Danupon Yang, Liu a ďalší

Zdroj: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ISBN: 9781611975994
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Predmety: ta113, FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Prístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.126
http://arxiv.org/abs/1910.14344
http://juuli.fi/Record/0369264820
https://doi.org/10.1137/1.9781611975994.126
https://arxiv.org/abs/1910.14344
https://research.aalto.fi/en/publications/computing-and-testing-small-connectivity-in-near-linear-time-and-
http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-14344
http://arxiv.org/pdf/1910.14344.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-14344
http://www.diva-portal.org/smash/record.jsf?pid=diva2:1453993

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree

Autori: Elkin, Yury Kurlin, Vitaliy

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 02 engineering and technology

Prístupová URL adresa: http://arxiv.org/abs/2111.15478

Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees

Autori: Ran Duan Tianyi Zhang Haoqing He

Zdroj: Lecture Notes in Computer Science ISBN: 9783030617912

Predmety: 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

Prístupová URL adresa: http://arxiv.org/pdf/1712.09166
http://arxiv.org/abs/1712.09166
https://dblp.uni-trier.de/db/journals/corr/corr1712.html#abs-1712-09166
https://arxiv.org/abs/1712.09166
https://arxiv.org/pdf/1712.09166.pdf
https://ui.adsabs.harvard.edu/abs/2017arXiv171209166D/abstract
https://rd.springer.com/chapter/10.1007/978-3-030-61792-9_2
https://link.springer.com/chapter/10.1007/978-3-030-61792-9_2

An Experimental Study of a Near-Linear Time Algorithm for Small Vertex Connectivity

Additional Titles: En experimentell studie av en algorithm för att beräkna låg nodanslutning i nästan linjär tid

Autori: Yingchareonthawornchai, Sorrachai Perustieteiden korkeakoulu Chalermsook, Parinya a ďalší

Témy: G2 Pro gradu, diplomityö

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time

Autori: Elkin, Michael Khuzman, Ariel

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

Edge connectivity augmentation in near-linear time

Autori: Cen, Ruoxu Li, Jason Panigrahi, Debmalya

Zdroj: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. :137-150

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/2205.04636