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

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Autoři: Nilsson, Bengt J. Packer, Eli

Zdroj: Algorithmica. 86(9):2845-2884

Témata: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69948
https://doi.org/10.1007/s00453-024-01245-0

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

Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products

Autoři: Kowaluk, Mirosław Lingas, Andrzej Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Originator

Přispěvatelé: Kowaluk, Mirosław Lingas, Andrzej Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Originator

Zdroj: International Journal of Foundations of Computer Science. 35(07):871-886

Témata: Natural Sciences, Mathematical Sciences, Computational Mathematics, Naturvetenskap, Matematik, Beräkningsmatematik

Přístupová URL adresa: https://doi.org/10.1142/S0129054123500259

Exact and approximation algorithms for routing a convoy through a graph

Autoři: Martijn van Ee Tim Oosterwijk René Sitters a další

Přispěvatelé: Martijn van Ee Tim Oosterwijk René Sitters a další

Zdroj: Mathematical Programming. 213:985-1008

Témata: 90C27, 90C39, Shortest path problem, Traveling salesperson problem, 0211 other engineering and technologies, 68Q25, traveling salesperson problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W25, Approximation algorithms, Convoy routing, ddc:004, approximation algorithms, convoy routing, shortest path problem

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/1871.1/cae572ff-f830-4025-82ed-460f67cd18e9
https://research.vu.nl/en/publications/cae572ff-f830-4025-82ed-460f67cd18e9
https://doi.org/10.1007/s10107-024-02159-z
https://research.vu.nl/en/publications/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://hdl.handle.net/1871.1/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://doi.org/10.4230/LIPIcs.MFCS.2023.86
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.86

Iterative polynomial approximation algorithms for inverse graph filters

Autoři: Cheng, Cheng Sun, Qiyu Zheng, Cong

Zdroj: 2025 International Conference on Sampling Theory and Applications (SampTA). :1-5

Témata: Signal Processing (eess.SP), FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing

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

Tight Approximation Algorithms for 2D Guillotine Strip Packing

Autoři: Arindam Khan Aditya Lonkar Arnab Maiti a další

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

Témata: ddc

Popis souboru: application/pdf

Přístupová URL adresa: https://mediatum.ub.tum.de/1833029

Approximation Algorithms for Cooperative Multi-Robot Patrolling in Core-Periphery Graph Settings

Autoři: Alex Bassot Stefano Carpin Nicola Basilico

Zdroj: 2025 IEEE 21st International Conference on Automation Science and Engineering (CASE). :2267-2274

Approximation Algorithms for Dynamic Inventory Management on Networks

Autoři: Levi DeValve Jabari Myles

Zdroj: Management Science. 71:5893-5909

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Autoři: Bansal, Ishan Cheriyan, Joseph Grout, Logan a další

Přispěvatelé: Bansal, Ishan Cheriyan, Joseph Grout, Logan a další

Zdroj: Algorithmica. 86:2575-2604

Témata: FOS: Computer and information sciences, flexible graph connectivity, network design, 0211 other engineering and technologies, edge-connectivity of graphs, 0102 computer and information sciences, 02 engineering and technology, Small cuts, 01 natural sciences, Theory of computation → Approximation algorithms analysis, f-connectivity problem, primal-dual method, Edge-connectivity of graphs, Primal-dual method, Minimum cuts, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithms, Network design, minimum cuts, f-Connectivity problem, Approximation algorithms, Flexible Graph Connectivity, flexible Graph Connectivity, ddc:004, small cuts

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2209.11209
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.15
http://eprints.lse.ac.uk/123858/
http://eprints.lse.ac.uk/120005/

Improved approximation algorithms for the k-path partition problem: Improved approximation algorithms for the \(k\)-path partition problem

Autoři: Shiming Li Wei Yu Zhaohui Liu

Zdroj: Journal of Global Optimization. 90:983-1006

Témata: Combinatorial optimization, local search, path partition problem, maximum traveling salesman problem, Approximation algorithms, approximation algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7941543
https://doi.org/10.1007/s10898-024-01428-7

Responsible RecSys by Design: Approximation Algorithms for Calibrated Recommendations with Sponsored Items

Autoři: Jing Yuan Shaojie Tang Shuzhang Cai a další

Zdroj: Proceedings of the International AAAI Conference on Web and Social Media. 19:2197-2209

Exact and Approximation Algorithms for Sparse Principal Component Analysis

Autoři: Yongchun Li Weijun Xie

Zdroj: INFORMS Journal on Computing. 37:582-602

Témata: 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights

Autoři: Ameet Gadekar Aristides Gionis Suhas Thejaswi

Zdroj: Proceedings of the ACM on Web Conference 2025. :4458-4469

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Computers and Society, Artificial Intelligence (cs.AI), Discrete Mathematics (cs.DM), Computer Science - Artificial Intelligence, Computers and Society (cs.CY), Computer Science - Discrete Mathematics, Machine Learning (cs.LG)

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

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning

Autoři: Jingyang Zhao Mingyu Xiao Junqiang Peng a další

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 39:26742-26749

Approximation algorithms for 1-Wasserstein distance between persistence diagrams

Autoři: Chen, Samantha Wang, Yusu Samantha Chen and Yusu Wang

Přispěvatelé: Chen, Samantha Wang, Yusu Samantha Chen and Yusu Wang

Zdroj: Computational Geometry. 129:102190

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, I.3.6, 4. Education, 0102 computer and information sciences, 15. Life on land, 7. Clean energy, 01 natural sciences, optimal transport, 13. Climate action, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Wasserstein distance, ddc:004, E.1, approximation algorithms, persistence diagrams

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2104.07710
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.14

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms.

Autoři: Albers, Susanne Gálvez, Waldo Özdemir, Ömer Behic

Zdroj: Procedia Computer Science. 2025, Vol. 273, p301-308. 8p.

Témata: Bin packing problem, Approximation algorithms, Resource allocation, NP-hard problems, Optimization algorithms

Improved Approximation Algorithms for Three-Dimensional Bin Packing

Autoři: Kar, Debajyoti Khan, Arindam Rau, Malin

Zdroj: 52nd EATCS International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark Leibniz International Proceedings in Informatics, LIPIcs. 334

Témata: Geometric Packing, Approximation Algorithms, Multidimensional Packing

Popis souboru: electronic

Přístupová URL adresa: https://research.chalmers.se/publication/547453
https://research.chalmers.se/publication/547453/file/547453_Fulltext.pdf

A survey of exact and approximation algorithms for linear-parametric optimization problems

Autoři: Levin Nemesch Stefan Ruzika Clemens Thielen a další

Zdroj: Journal of Global Optimization. 93:299-333

Témata: Mathematics - Optimization and Control

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

Приближённые алгоритмы для задач кластеризации на графах с кластерами небольшого размера: Approximation algorithms for graph clustering problems with clusters of bounded size

Zdroj: Diskretnyi Analiz i Issledovanie Operatsii. 32:40-57

Approximation Algorithms for the Geometric Multimatching Problem

Autoři: Shinwoo An Eunjin Oh Jie Xue

Zdroj: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :2317-2328