Výsledky vyhledávání - "Dynamic algorithms"

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:921-945

Témata: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

Pricing principles in the field of ready–made meal delivery: analysis of influence factors

Autoři: K. V. Martynov

Zdroj: Путеводитель предпринимателя, Vol 18, Iss 2, Pp 74-82 (2025)

Témata: catering market, dynamic algorithms, HF5001-6182, logistics, seasonality, packaging, pricing, service, Business, food delivery, cost price, loyalty

Přístupová URL adresa: https://doaj.org/article/b6d493a91d8e4f01981d7bc2ef029f81

Fully Dynamic Submodular Maximization over Matroids

Autoři: Paul Dütting Federico Fusco Silvio Lattanzi a další

Zdroj: ACM Transactions on Algorithms

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, Submodular Maximization, Matroids, Fully Dynamic Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), Machine Learning (stat.ML), 0102 computer and information sciences, 02 engineering and technology, submodular maximization, fully dynamic, 01 natural sciences, Machine Learning (cs.LG)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2305.19918
https://hdl.handle.net/11573/1693542
https://hdl.handle.net/11573/1744847
https://doi.org/10.1145/3698397

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

Autoři: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a další

Přispěvatelé: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a další

Zdroj: Algorithmica. 86:2997-3026

Témata: FOS: Computer and information sciences, dynamic algorithms, interval scheduling, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, local computation algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2012.15002
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45

Decremental (1 + ϵ)-Approximate Maximum Eigenvector: Dynamic Power Method

Autoři: Adil, Deeksha Saranurak, Thatchaphol Censor-Hillel, Keren a další

Přispěvatelé: Adil, Deeksha Saranurak, Thatchaphol Censor-Hillel, Keren a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 334
52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)

Témata: Power Method, Dynamic Algorithms

Popis souboru: application/application/pdf

Přístupová URL adresa: http://hdl.handle.net/20.500.11850/745335

Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time

Autoři: Mohsen Ghaffari Christoph Grunau Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Přispěvatelé: Mohsen Ghaffari Christoph Grunau Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1184-1191

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

Popis souboru: application/pdf

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

Emergent role of dynamic optimization in cardiac resynchronization therapy: Systematic review and network meta‐analysis

Autoři: Előd‐János Zsigmond Richárd Masszi Réka Ehrenberger a další

Zdroj: ESC Heart Fail
ESC Heart Failure, Vol 11, Iss 6, Pp 4046-4060 (2024)

Témata: Heart Failure, empirical settings, dynamic algorithms, Network Meta-Analysis, cardiac resynchronization therapy, 3. Good health, Cardiac Resynchronization Therapy, 03 medical and health sciences, 0302 clinical medicine, Echocardiography, RC666-701, echocardiography, Diseases of the circulatory (Cardiovascular) system, Humans, Original Article, Cardiac Resynchronization Therapy Devices, device optimization, Algorithms

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/39104128
https://doaj.org/article/a4ecdb33df66403db5bcd799280e67a1

Efficient Contractions of Dynamic Graphs -- with Applications

Autoři: Henzinger, Monika Kosinas, Evangelos Münk, Robin a další

Přispěvatelé: Henzinger, Monika Kosinas, Evangelos Münk, Robin a další

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Cut Sparsifiers, Data Structures and Algorithms (cs.DS), Graph Algorithms, ddc:004, Dynamic Algorithms

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2509.05157
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.36

Faster Dynamic 2-Edge Connectivity in Directed Graphs

Autoři: Georgiadis, Loukas Giannis, Konstantinos Italiano, Giuseppe F. a další

Přispěvatelé: Georgiadis, Loukas Giannis, Konstantinos Italiano, Giuseppe F. a další

Témata: Connectivity, dynamic algorithms, ddc:004, directed graphs

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.26

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds

Autoři: Boneh, Itai Gorbachev, Egor Kociumaka, Tomasz a další

Přispěvatelé: Boneh, Itai Gorbachev, Egor Kociumaka, Tomasz a další

Témata: FOS: Computer and information sciences, dynamic algorithms, conditional lower bounds, Data Structures and Algorithms, Edit distance, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2507.02548
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.45

On Incremental Approximate Shortest Paths in Directed Graphs

Autoři: Górkiewicz, Adam Karczmarz, Adam Adam Górkiewicz and Adam Karczmarz

Přispěvatelé: Górkiewicz, Adam Karczmarz, Adam Adam Górkiewicz and Adam Karczmarz

Témata: incremental shortest paths, FOS: Computer and information sciences, dynamic shortest paths, Computer Science - Data Structures and Algorithms, offline dynamic algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2502.10348
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.93

Fully Dynamic Algorithms for Transitive Reduction

Autoři: Goranci, Gramoz Karczmarz, Adam Momeni, Ali a další

Přispěvatelé: Goranci, Gramoz Karczmarz, Adam Momeni, Ali a další

Témata: FOS: Computer and information sciences, Data structures, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Spectral sparsification, Dynamic algorithms, (Directed) hypergraphs

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2504.18161
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.92

Dynamic Maximum Depth of Geometric Objects

Autoři: Suri, Subhash Xue, Jie Yang, Xiongxin a další

Přispěvatelé: Suri, Subhash Xue, Jie Yang, Xiongxin a další

Témata: maximum depth, dynamic algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.77

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471)

Autoři: Censor-Hillel, Keren Nazari, Yasamin Rotenberg, Eva a další

Přispěvatelé: Censor-Hillel, Keren Nazari, Yasamin Rotenberg, Eva a další

Témata: distributed algorithms, dynamic algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.11.92

On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability

Autoři: Shankaranarayanan Krishna Aniket Lal Andreas Pavlogiannis a další

Zdroj: Krishna, S, Lal, A, Pavlogiannis, A & Tuppe, O 2024, 'On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability', Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, pp. 1239-1268. https://doi.org/10.1145/3632884

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Programming Languages, dynamic algorithms, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), CFL reachability, static analysis, 0202 electrical engineering, electronic engineering, information engineering, Programming Languages (cs.PL)

Přístupová URL adresa: http://arxiv.org/abs/2311.04319
https://pure.au.dk/portal/en/publications/9fa9c9b1-b1f4-46e0-b520-e383a7dd9520
https://doi.org/10.1145/3632884

The Complexity Landscape of Dynamic Distributed Subgraph Finding

Autoři: Chang, Yi-Jun Chen, Lyuting Chen, Yanyu a další

Přispěvatelé: Chang, Yi-Jun Chen, Lyuting Chen, Yanyu a další

Témata: Distributed algorithms, dynamic algorithms, subgraph finding

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.22

Dostupnost: https://doi.org/10.4230/LIPIcs.DISC.2025.22
https://nbn-resolving.org/urn:nbn:de:0030-drops-248399
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.22

Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method

Autoři: Adil, Deeksha Saranurak, Thatchaphol Deeksha Adil and Thatchaphol Saranurak

Přispěvatelé: Adil, Deeksha Saranurak, Thatchaphol Deeksha Adil and Thatchaphol Saranurak

Témata: Power Method, Dynamic Algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.6

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2025.6
https://nbn-resolving.org/urn:nbn:de:0030-drops-233834
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.6

Deterministic Dynamic Matching in Worst-Case Update Time

Autoři: Kiss, Peter Peter Kiss

Přispěvatelé: Kiss, Peter Peter Kiss

Zdroj: Algorithmica. 85:3741-3765

Témata: FOS: Computer and information sciences, Approximate Matching, EDCS, 0102 computer and information sciences, 02 engineering and technology, Dynamic Algorithms, 01 natural sciences, QA76, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Matching, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, QA

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2108.10461
http://wrap.warwick.ac.uk/160478/13/WRAP-Deterministic-dynamic-matching-in-worst-case-update-time-Kiss-2022.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.94

Fast Algorithms via Dynamic-Oracle Matroids

Autoři: Blikstad, Joakim Mukhopadhyay, Sagnik Na Nongkai, Danupon a další

Zdroj: STOC 2023. :1229-1242

Témata: arboricity, combinatorial optimization, dynamic algorithms, matroid intersection, matroid union, matroids, spanning tree packing

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-333365
https://doi.org/10.1145/3564246.3585219

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch

Autoři: Forster, Sebastian Nazari, Yasamin Probst Gutenberg, Maximilian a další

Přispěvatelé: Forster, Sebastian Nazari, Yasamin Probst Gutenberg, Maximilian a další

Zdroj: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Proceedings of the 55th Annual ACM Symposium on Theory of Computing

Témata: FOS: Computer and information sciences, Dynamic algorithms, Shortest paths, Graph algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Popis souboru: application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2211.04217
http://hdl.handle.net/20.500.11850/620428