Search Results - "Approximation algorithms"
-
1
Authors:
Source: Algorithmica. 86(9):2845-2884
Subject Terms: Art gallery problems, Visibility, Watchman routes, Approximation algorithms
File Description: print
-
2
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Discrete Mathematics. 39:921-945
Subject Terms: 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
File Description: application/xml; application/pdf
-
3
Authors:
Contributors:
Source: International Journal of Foundations of Computer Science. 35(07):871-886
Subject Terms: Natural Sciences, Mathematical Sciences, Computational Mathematics, Naturvetenskap, Matematik, Beräkningsmatematik
Access URL: https://doi.org/10.1142/S0129054123500259
-
4
Authors: et al.
Contributors: et al.
Source: Mathematical Programming. 213:985-1008
Subject Terms: 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
File Description: application/pdf
Access URL: 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 -
5
Authors:
Source: 2025 International Conference on Sampling Theory and Applications (SampTA). :1-5
Subject Terms: Signal Processing (eess.SP), FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing
Access URL: http://arxiv.org/abs/2504.14341
-
6
Authors: et al.
Source: ACM Transactions on Algorithms. 21:1-30
Subject Terms: ddc
File Description: application/pdf
Access URL: https://mediatum.ub.tum.de/1833029
-
7
Authors:
Source: 2025 IEEE 21st International Conference on Automation Science and Engineering (CASE). :2267-2274
-
8
Authors:
Source: Management Science. 71:5893-5909
-
9
Authors: et al.
Contributors: et al.
Source: Algorithmica. 86:2575-2604
Subject Terms: 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
File Description: application/pdf
-
10
Authors:
Source: Journal of Global Optimization. 90:983-1006
Subject Terms: Combinatorial optimization, local search, path partition problem, maximum traveling salesman problem, Approximation algorithms, approximation algorithm
File Description: application/xml
-
11
Authors: et al.
Source: Proceedings of the International AAAI Conference on Web and Social Media. 19:2197-2209
-
12
Authors:
Source: INFORMS Journal on Computing. 37:582-602
-
13
Authors:
Source: Proceedings of the ACM on Web Conference 2025. :4458-4469
Subject Terms: 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)
Access URL: http://arxiv.org/abs/2410.12913
-
14
Authors: et al.
Source: Proceedings of the AAAI Conference on Artificial Intelligence. 39:26742-26749
-
15
Authors:
Contributors:
Source: Computational Geometry. 129:102190
Subject Terms: 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
File Description: application/pdf
-
16
Authors:
Source: Procedia Computer Science. 2025, Vol. 273, p301-308. 8p.
-
17
Authors:
Source: 52nd EATCS International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark Leibniz International Proceedings in Informatics, LIPIcs. 334
Subject Terms: Geometric Packing, Approximation Algorithms, Multidimensional Packing
File Description: electronic
-
18
Authors: et al.
Source: Journal of Global Optimization. 93:299-333
Subject Terms: Mathematics - Optimization and Control
Access URL: http://arxiv.org/abs/2501.11544
-
19
Source: Diskretnyi Analiz i Issledovanie Operatsii. 32:40-57
-
20
Authors:
Source: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :2317-2328
Full Text Finder 
Nájsť tento článok vo Web of Science