Search Results - "Computer Science - Data Structures and Algorithms"

A near-optimal kernel for a coloring problem

Authors: Ishay Haviv Dror Rabinovich

Source: Discrete Applied Mathematics. 377:66-73

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/2504.12281

Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds

Authors: Gutekunst, Samuel C.

Source: Discrete Applied Mathematics. 376:208-224

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

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

The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing

Authors: Weidner, Matthew Kleppmann, Martin Apollo - University of Cambridge Repository

Contributors: Weidner, Matthew Kleppmann, Martin Apollo - University of Cambridge Repository

Source: IEEE Transactions on Parallel and Distributed Systems. 36:2425-2437

Subject Terms: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 46 Information and Computing Sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)

File Description: application/pdf

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

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Authors: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Contributors: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Source: ACM Transactions on Algorithms. 21:1-26

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Approximation Algorithms, FPT algorithms, Steiner Forest

File Description: application/pdf

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

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges

Authors: Binucci C. Liotta G. Montecchiani F. et al.

Contributors: Binucci C. Liotta G. Montecchiani F. et al.

Source: Journal of Graph Algorithms and Applications. 29:247-266

Subject Terms: graph drawing, Computational Geometry (cs.CG), FOS: Computer and information sciences, st-orientations, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, parameterized complexity

File Description: application/pdf

Access URL: http://arxiv.org/abs/2306.03196
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.18

Parameterized Max Min Feedback Vertex Set

Authors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Contributors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Source: SIAM Journal on Discrete Mathematics. 39:1587-1620

Subject Terms: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2302.09604
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.62

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages

Authors: Victor Campos Jonas Costa Raul Lopes et al.

Contributors: Victor Campos Jonas Costa Raul Lopes et al.

Source: ACM Transactions on Algorithms. 21:1-28

Subject Terms: FOS: Computer and information sciences, min-max relation, directed disjoint paths, directed graphs, bramble, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, matroids, half-integral linkage, parameterized complexity

File Description: application/pdf

Access URL: http://arxiv.org/abs/2306.16134
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.30

High-level quantum algorithm programming using Silq

Authors: Viktorija Bezganovic Marco Lewis Sadegh Soudjani et al.

Source: Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing. :1-11

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Programming Languages, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), quantum computing, programming, silq, quantum algorithms, Quantum Physics (quant-ph), Programming Languages (cs.PL)

Access URL: http://arxiv.org/abs/2409.10231
https://hdl.handle.net/11573/1748867
https://doi.org/10.1145/3731545.3744152

The Price of Hierarchical Clustering

Authors: Arutyunova, Anna Röglin, Heiko Anna Arutyunova and Heiko Röglin

Contributors: Arutyunova, Anna Röglin, Heiko Anna Arutyunova and Heiko Röglin

Source: Algorithmica. 87:1420-1452

Subject Terms: FOS: Computer and information sciences, k-center Problem, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), approximation Algorithms, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Hierarchical Clustering, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2205.01417
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.10

On the tractability of defensive alliance problem

Authors: Sangam Balchandar Reddy Anjeneya Swami Kare

Source: Discrete Applied Mathematics. 380:116-127

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

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

Greediness is not always a vice: Efficient discovery algorithms for assignment problems

Authors: Romaric Duvignau Noël Gillet Ralf Klasing

Source: Discrete Applied Mathematics. 378:65-86

Subject Terms: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

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

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

Authors: Nikolaos Tziavelis Wolfgang Gatterbauer Mirek Riedewald

Source: ACM Transactions on Database Systems. 51:1-47

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Databases, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Databases (cs.DB), Data Structures and Algorithms (cs.DS), 02 engineering and technology, Logic in Computer Science (cs.LO)

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

On the Robustness of the Successive Projection Algorithm

Authors: Giovanni Barbarino Nicolas Gillis

Source: SIAM Journal on Matrix Analysis and Applications. 46:2140-2170

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Machine Learning (stat.ML), Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Machine Learning (cs.LG)

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

Low-depth Amplitude Estimation without Really Trying

Authors: Dinh-Long Vu Bin Cheng Patrick Rebentrost

Source: ACM Transactions on Quantum Computing. 6:1-23

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)

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

Efficiency of Self-Adjusting Heaps

Authors: Corwin Sinnamon Robert E. Tarjan

Source: ACM Transactions on Algorithms. 21:1-39

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, F.2.2, 01 natural sciences

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

Combinatorial and asymptotic results on the neighborhood grid

Authors: Alex McDonough Ulrich Reitebuch Martin Skrodzki

Source: Discrete Applied Mathematics. 372:48-64

Subject Terms: FOS: Computer and information sciences, E.1, F.2.2, G.2.1, Neighborhood grid, Spatial data structure, 0102 computer and information sciences, 02 engineering and technology, Young tableaux, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematik, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, 05A99, Asymptotic, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Uniqueness

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

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers

Authors: Danny Segev

Source: Operations Research. 73:2744-2760

Subject Terms: FOS: Computer and information sciences, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 02 engineering and technology, Mathematics - Optimization and Control

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

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution

Authors: Songhua Li Lingjie Duan

Source: IEEE Transactions on Network Science and Engineering. 12:4275-4286

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 11. Sustainability, Computer Science - Data Structures and Algorithms, Computer Science - Social and Information Networks, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

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

Exploring monotone priority queues for Dijkstra optimization

Authors: Jonas Costa Lucas Castro Rosiane de Freitas

Source: RAIRO - Operations Research. 59:2419-2436

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/2409.06061

Counting stars is constant-degree optimal for detecting any planted subgraph

Authors: Xifan Yu Ilias Zadik Peiyuan Zhang

Source: Mathematical Statistics and Learning. 8:105-164

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Statistics Theory, Data Structures and Algorithms (cs.DS), Statistics Theory (math.ST), Computational Complexity (cs.CC)

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