Suchergebnisse - "computer science - data structures and algorithms"

A near-optimal kernel for a coloring problem

Autoren: Ishay Haviv Dror Rabinovich

Quelle: Discrete Applied Mathematics. 377:66-73

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

Zugangs-URL: http://arxiv.org/abs/2504.12281

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

Autoren: Gutekunst, Samuel C.

Quelle: Discrete Applied Mathematics. 376:208-224

Schlagwörter: 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

Zugangs-URL: http://arxiv.org/abs/2506.10758

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

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

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

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

Schlagwörter: 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)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2305.00583

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Autoren: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Weitere Verfasser: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

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

Weitere Verfasser: Binucci C. Liotta G. Montecchiani F. et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Autoren: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Weitere Verfasser: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Autoren: Victor Campos Jonas Costa Raul Lopes et al.

Weitere Verfasser: Victor Campos Jonas Costa Raul Lopes et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Autoren: Viktorija Bezganovic Marco Lewis Sadegh Soudjani et al.

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

Schlagwörter: 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)

Zugangs-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

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

Weitere Verfasser: Arutyunova, Anna Röglin, Heiko Anna Arutyunova and Heiko Röglin

Quelle: Algorithmica. 87:1420-1452

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Autoren: Sangam Balchandar Reddy Anjeneya Swami Kare

Quelle: Discrete Applied Mathematics. 380:116-127

Schlagwörter: 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)

Zugangs-URL: http://arxiv.org/abs/2307.09760

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

Autoren: Romaric Duvignau Noël Gillet Ralf Klasing

Quelle: Discrete Applied Mathematics. 378:65-86

Schlagwörter: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/abs/2410.09434

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

Autoren: Nikolaos Tziavelis Wolfgang Gatterbauer Mirek Riedewald

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

Schlagwörter: 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)

Zugangs-URL: http://arxiv.org/abs/2205.05649

On the Robustness of the Successive Projection Algorithm

Autoren: Giovanni Barbarino Nicolas Gillis

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

Schlagwörter: 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)

Zugangs-URL: http://arxiv.org/abs/2411.16195

Low-depth Amplitude Estimation without Really Trying

Autoren: Dinh-Long Vu Bin Cheng Patrick Rebentrost

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

Schlagwörter: 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)

Zugangs-URL: http://arxiv.org/abs/2410.01173

Efficiency of Self-Adjusting Heaps

Autoren: Corwin Sinnamon Robert E. Tarjan

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

Schlagwörter: 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

Zugangs-URL: http://arxiv.org/abs/2307.02772

Combinatorial and asymptotic results on the neighborhood grid

Autoren: Alex McDonough Ulrich Reitebuch Martin Skrodzki

Quelle: Discrete Applied Mathematics. 372:48-64

Schlagwörter: 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

Zugangs-URL: http://arxiv.org/abs/1710.03435

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers

Autoren: Danny Segev

Quelle: Operations Research. 73:2744-2760

Schlagwörter: 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

Zugangs-URL: http://arxiv.org/abs/2209.13878

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution

Autoren: Songhua Li Lingjie Duan

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

Schlagwörter: 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

Zugangs-URL: http://arxiv.org/abs/2308.13260

Exploring monotone priority queues for Dijkstra optimization

Autoren: Jonas Costa Lucas Castro Rosiane de Freitas

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

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

Zugangs-URL: http://arxiv.org/abs/2409.06061

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

Autoren: Xifan Yu Ilias Zadik Peiyuan Zhang

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

Schlagwörter: 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)

Zugangs-URL: http://arxiv.org/abs/2403.17766