Search Results - "Theory of computation → Approximation algorithms analysis"
-
1
Authors:
Contributors:
Source: Algorithmica. 86:3598-3628
Subject Terms: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization
File Description: application/pdf
-
2
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
-
3
-
4
Authors: et al.
Subject Terms: ddc:004, Min-Plus Convolution, Fine-grained Complexity, Conditional Lower Bounds, DATA processing & computer science, Approximation Schemes, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
-
5
Authors:
Source: Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35 ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15
Subject Terms: String attractors, Theory of computation → Approximation algorithms analysis, Theory of computation → Data compression, Theory of computation → Problems, reductions and completeness, computational complexity, dictionary compression
Subject Geographic: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400035
-
6
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)Subject Terms: Theory of computation → Approximation algorithms analysis, Theory of computation → Unsupervised learning and clustering, Clustering, K-means, K-means++, Adversarial noise
File Description: application/application/pdf
Access URL: http://hdl.handle.net/20.500.11850/637195
-
7
Authors:
Contributors:
Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, Theory of computation → Problems, reductions and completeness, ddc:004, Computational Complexity (cs.CC), Theory of computation → Data compression, String attractors, dictionary compression, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Source: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States
Subject Terms: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]
Subject Geographic: Seattle, United States
-
9
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-04143445 ; 2023.
Subject Terms: data-driven wasserstein distributionally robust optimization, optimization under uncertainty, computational complexity, approximability, 2012 ACM Subject Classification Theory of computation → Complexity classes, Mathematics of computing → Combinatorial optimization, Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, 2012 ACM Subject Classification Theory of computation → Complexity classes Mathematics of computing → Combinatorial optimization Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
10
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, network design, capacitated network design, parametrized algorithms, Steiner cycle problem, 0102 computer and information sciences, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Approximation algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Steiner 2-edge connected subgraphs, approximation algorithms, Network design, Capacitated network design, Parametrized algorithms, Steiner 2-node connected subgraphs
File Description: application/pdf
-
11
Authors: et al.
Contributors: et al.
Subject Terms: Theory of computation → Parallel computing models, Mathematics of computing → Matroids and greedoids, Combinatorial Optimization, Parallel Algorithms, Theory of computation → Discrete optimization, Matroid Intersection, ddc:004, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Source: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in InformaticsSubject Terms: FOS: Computer and information sciences, Hardness of Approximation in P, Fine-grained Complexity Theory, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Classification Theorems, Data Structures and Algorithms (cs.DS), ddc:004
File Description: application/pdf
-
13
Authors: et al.
Contributors: et al.
Source: 30th Annual European Symposium on Algorithms
Leibniz International Proceedings in InformaticsSubject Terms: FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, exponential approximations, monotone local search, 0211 other engineering and technologies, Mathematics of computing → Probabilistic algorithms, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, parameterized approximations, Data Structures and Algorithms (cs.DS), ddc:004
File Description: application/pdf
Access URL: http://arxiv.org/abs/2206.13481
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.50
http://hdl.handle.net/21.11116/0000-000C-1E71-4
http://hdl.handle.net/21.11116/0000-000C-1E6F-8
http://hdl.handle.net/21.11116/0000-000C-1DA2-D
http://hdl.handle.net/21.11116/0000-000C-1DA4-B -
14
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, 0211 other engineering and technologies, Theory of computation → Discrete optimization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Mathematics of computing → Matroids and greedoids, Combinatorial Optimization, Computer Science - Data Structures and Algorithms, Matroid Intersection, Data Structures and Algorithms (cs.DS), ddc:004, Approximation Algorithms
File Description: application/pdf
Access URL: http://arxiv.org/abs/2105.05673
https://arxiv.org/pdf/2105.05673
https://drops.dagstuhl.de/opus/volltexte/2021/14100/
https://arxiv.org/abs/2105.05673
https://drops.dagstuhl.de/opus/volltexte/2021/14100/pdf/LIPIcs-ICALP-2021-31.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-05673
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.31 -
15
Authors: et al.
Contributors: et al.
Source: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021
Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Approximation algorithms, two-dimensional knapsack, geometric packing
File Description: application/pdf
Access URL: http://arxiv.org/abs/2103.10406
http://eprints.iisc.ac.in/69046/
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-10406
https://drops.dagstuhl.de/opus/volltexte/2021/13838/pdf/LIPIcs-SoCG-2021-39.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13838/
https://research.vu.nl/en/publications/improved-approximation -algorithms -for-2-dimensional-knapsack-pack
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F84354690-4f21-4804-a4f2-e3ad3ffe5597
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.39 -
16
Authors: et al.
Contributors: et al.
Source: 34th International Symposium on Computational Geometry (SoCG 2018)
https://hal.science/hal-01797822
34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩Subject Terms: Hall's marriage theorem, matchings, expansion, local search, 2012 ACM Subject Classification Theory of computation ! Approximation algorithms analysis, Mathematics of computing ! Combinatorial optimization, Mathematics of computing ! Graph theory, Mathematics of computing ! Approximation algorithms, [SCCO.COMP]Cognitive science/Computer science, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
17
Authors: et al.
Contributors: et al.
Source: 32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, July 5-7, 2021, Wroc{\l}aw, Poland
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
https://hal.science/hal-03457156
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wrocław, Poland. ⟨10.4230/LIPIcs.CPM.2021.14⟩Subject Terms: Longest Subsequence, Approximation Hardness, Kernelization, Theory of computation → Graph algorithms analysis phrases Parameterized complexity, Theory of computation → Approximation algorithms analysis, 2012 ACM Subject Classification Theory of computation → Fixed parameter tractability, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Full Text Finder 
Nájsť tento článok vo Web of Science