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

Splitting-off in hypergraphs

Authors: Kristóf Bérczi Karthekeyan Chandrasekaran Tamás Király et al.

Contributors: Kristóf Bérczi Karthekeyan Chandrasekaran Tamás Király et al.

Source: Journal of Combinatorial Theory, Series B. 176:319-383

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Hypergraph Orientations, Hypergraphs, Constructive Characterizations, Submodular Functions, Combinatorial Optimization, Computer Science - Data Structures and Algorithms, Hypergraph Connectivity, Data Structures and Algorithms (cs.DS), ddc:004, Splitting-off, Computer Science - Discrete Mathematics

File Description: application/pdf

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

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

Color Fault-Tolerant Spanners

Authors: Asaf Petruschka Shay Sapir Elad Tzalik et al.

Contributors: Asaf Petruschka Shay Sapir Elad Tzalik et al.

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

Subject Terms: FOS: Computer and information sciences, Graph spanners, Computer Science - Data Structures and Algorithms, Fault tolerance, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.08868
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.88

Online Coalition Formation under Random Arrival or Coalition Dissolution

Authors: Martin Bullinger René Romen Martin Bullinger and René Romen

Contributors: Martin Bullinger René Romen Martin Bullinger and René Romen

Source: ACM Transactions on Algorithms. 22:1-43

Subject Terms: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Online Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Online Matching, ddc, Coalition Formation, Computer Science and Game Theory (cs.GT)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2306.16965
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.27
https://mediatum.ub.tum.de/doc/1833042/document.pdf

A near-optimal kernel for a coloring problem

Authors: Ishay Haviv Dror Rabinovich

Source: Discrete Applied Mathematics. 377:66-73

Subject Terms: Graph theory, FOS: Computer and information sciences, Discrete mathematics in relation to computer science, linear algebra, kernelization, Computer Science - Data Structures and Algorithms, graph coloring, Theory of computing, Data Structures and Algorithms (cs.DS), parameterized complexity

File Description: application/xml

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

Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds: 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), traveling salesman problem, Mathematical programming, Buratti-Horak-Rosa conjecture, circulant, circulant TSP, Graph theory, polyhedral TSP, Polytopes and polyhedra, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Hamiltonian paths, Computer Science - Discrete Mathematics

File Description: application/xml

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

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks

Authors: Yunqi Zhang Shaileshh Bojja Venkatakrishnan

Source: Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. :321-330

Subject Terms: Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Science - Cryptography and Security, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Cryptography and Security (cs.CR), Multiagent Systems (cs.MA)

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

An Adversarially Robust Data Market for Spatial, Crowd-sourced Data

Authors: Aida Manzano Kharman Christian Jursitzky Quan Zhou et al.

Source: Distributed Ledger Technologies: Research and Practice. 4:1-20

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, 0506 political science

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

Fast and Small Subsampled R-indexes

Authors: Dustin Cobas Travis Gagie Gonzalo Navarro

Source: ACM Transactions on Algorithms. 22:1-29

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.14654

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 Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP

Authors: Karthik C. S. Lee, Euiwoong Manurangsi, Pasin et al.

Contributors: Karthik C. S. Lee, Euiwoong Manurangsi, Pasin et al.

Source: Algorithmica. 87:1711-1731

Subject Terms: k-median, FOS: Computer and information sciences, Parameterized complexity, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), Parameterized Inapproximability Hypothesis, max coverage, Hardness of Approximation

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.08917
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.6

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

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

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances

Authors: Jan van den Brand Hossein Gholizadeh Yonggang Jiang et al.

Source: Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures. :1-16

Subject Terms: FOS: Computer and information sciences, ddc:000, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer science, information & general works

File Description: application/pdf

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

The Price of Hierarchical Clustering: 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, Classification and discrimination, cluster analysis (statistical aspects), approximation Algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computational aspects of data analysis and big data, k-center Problem, k-diameter, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), k-center, ddc:004, Hierarchical Clustering, approximation algorithms, hierarchical clustering

File Description: application/xml; application/pdf

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

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions

Authors: Kia, Solmaz S.

Source: Encyclopedia of Systems and Control Engineering ISBN: 9780443140808

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

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

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