Suchergebnisse - "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

Parallel token swapping for qubit routing

Autoren: Ishan Bansal Oktay Günlük Richard Shapley

Quelle: Discrete Applied Mathematics. 377:480-497

Schlagwörter: FOS: Computer and information sciences, Quantum Physics, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)

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

Fast algorithms for Vizing's theorem on bounded degree graphs

Autoren: Anton Bernshteyn Abhishek Dhawan

Quelle: Journal of Combinatorial Theory, Series B. 175:69-125

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing, 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), 01 natural sciences

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

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

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion

Autoren: Blažej, Václav Jana, Satyabrata Ramanujan, M. S. et al.

Weitere Verfasser: Blažej, Václav Jana, Satyabrata Ramanujan, M. S. et al.

Quelle: Algorithmica. 87:1669-1709

Schlagwörter: FOS: Computer and information sciences, Parameterized complexity, Data Structures and Algorithms, Treewidth, Data Structures and Algorithms (cs.DS), ddc:004, Eulerian graphs

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2408.13819
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.4

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

Online Combinatorial Allocation with Interdependent Values

Autoren: Feldman, Michal Mauras, Simon Mohan, Divyarthi et al.

Weitere Verfasser: Feldman, Michal Mauras, Simon Mohan, Divyarthi et al.

Quelle: Proceedings of the 26th ACM Conference on Economics and Computation. :189-205

Schlagwörter: Interdependent Valuations, Computer Science and Game Theory, FOS: Computer and information sciences, Data Structures and Algorithms, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], Combinatorial Auctions, Online Algorithms, Data Structures and Algorithms (cs.DS), Computer Science and Game Theory (cs.GT)

Dateibeschreibung: application/pdf

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

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

On the twin-width of near-regular graphs

Autoren: Irene Heinrich Ferdinand Ihringer Simon Raßmann et al.

Quelle: Discrete Applied Mathematics. 379:177-193

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Combinatorics, 68Q25, 68R10, 68R05, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), F.2.2, G.2.1, G.2.2

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

Monitoring edge-geodetic sets in graphs

Autoren: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

Weitere Verfasser: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

Quelle: Discrete Applied Mathematics. 377:598-610

Schlagwörter: Edge-geodetic set, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Monitoring, Combinatorics, Feedback edge set, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences, NP-completeness

Dateibeschreibung: application/pdf

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

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

Glauber dynamics for the hard-core model on bounded-degree $H$ -free graphs

Autoren: Mark Jerrum

Quelle: Combinatorics, Probability and Computing. :1-12

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Combinatorics, Probability (math.PR), FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), F.2.2, 05C69 (Primary) 60J10, 68W20, 82B20 (Secondary), Probability

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

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