Výsledky vyhledávání - "Computer Science - Data Structures and Algorithms"

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

Autoři: Romaric Duvignau Noël Gillet Ralf Klasing

Zdroj: Discrete Applied Mathematics. 378:65-86

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2410.09434

A near-optimal kernel for a coloring problem

Autoři: Ishay Haviv Dror Rabinovich

Zdroj: Discrete Applied Mathematics. 377:66-73

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

Přístupová URL adresa: http://arxiv.org/abs/2504.12281

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

Autoři: Gutekunst, Samuel C.

Zdroj: Discrete Applied Mathematics. 376:208-224

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2506.10758

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

Autoři: Weidner, Matthew Kleppmann, Martin Apollo - University of Cambridge Repository

Přispěvatelé: Weidner, Matthew Kleppmann, Martin Apollo - University of Cambridge Repository

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

Témata: 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)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2305.00583

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs

Autoři: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

Přispěvatelé: Andreas Emil Feldmann Michael Lampis Andreas Emil Feldmann and Michael Lampis

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

Témata: 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

Popis souboru: application/pdf

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

Autoři: Binucci C. Liotta G. Montecchiani F. a další

Přispěvatelé: Binucci C. Liotta G. Montecchiani F. a další

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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2306.03196
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.18

Parameterized Max Min Feedback Vertex Set

Autoři: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a další

Přispěvatelé: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a další

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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2302.09604
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.62

On the tractability of defensive alliance problem

Autoři: Sangam Balchandar Reddy Anjeneya Swami Kare

Zdroj: Discrete Applied Mathematics. 380:116-127

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2307.09760

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

Autoři: Nikolaos Tziavelis Wolfgang Gatterbauer Mirek Riedewald

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2205.05649

On the Robustness of the Successive Projection Algorithm

Autoři: Giovanni Barbarino Nicolas Gillis

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2411.16195

Low-depth Amplitude Estimation without Really Trying

Autoři: Dinh-Long Vu Bin Cheng Patrick Rebentrost

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2410.01173

Efficiency of Self-Adjusting Heaps

Autoři: Corwin Sinnamon Robert E. Tarjan

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2307.02772

Combinatorial and asymptotic results on the neighborhood grid

Autoři: Alex McDonough Ulrich Reitebuch Martin Skrodzki

Zdroj: Discrete Applied Mathematics. 372:48-64

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/1710.03435

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers

Autoři: Danny Segev

Zdroj: Operations Research. 73:2744-2760

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2209.13878

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution

Autoři: Songhua Li Lingjie Duan

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2308.13260

Exploring monotone priority queues for Dijkstra optimization

Autoři: Jonas Costa Lucas Castro Rosiane de Freitas

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

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

Přístupová URL adresa: http://arxiv.org/abs/2409.06061

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

Autoři: Xifan Yu Ilias Zadik Peiyuan Zhang

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2403.17766

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters

Autoři: Zhuowei Zhao Junhao Gan Boyu Ruan a další

Zdroj: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :3980-3991

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

Přístupová URL adresa: http://arxiv.org/abs/2411.13817

PSSketch: Finding Persistent and Sparse Flow with High Accuracy and Efficiency

Autoři: Jiayao Wang Qilong Shi Xiyan Liang a další

Zdroj: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :2950-2961

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

Přístupová URL adresa: http://arxiv.org/abs/2505.04892

Fair Diversity Maximization with Few Representatives

Autoři: Florian Adriaens Nikolaj Tatti

Zdroj: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :17-25

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

Přístupová URL adresa: http://arxiv.org/abs/2506.08110