Výsledky vyhledávání - "Theory of computation → Approximation algorithms analysis"

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoři: Chien-Chung Huang François Sellier Huang, Chien-Chung

Přispěvatelé: Chien-Chung Huang François Sellier Huang, Chien-Chung

Zdroj: Algorithmica. 86:3598-3628

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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

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/

The 2-Attractor Problem Is NP-CompleteLIPIcs, Volume 289, STACS 2024Leibniz International Proceedings in Informatics (LIPIcs)

Autoři: Fuchs, Janosch Whittington, Philip

Témata: computational complexity, Theory of computation → Problems, reductions and completeness, String attractors, Theory of computation → Data compression, dictionary compression, Theory of computation → Approximation algorithms analysis

Exploring the Approximability Landscape of 3SUM

Autoři: Bringmann, Karl Ghazy, Ahmed Künnemann, Marvin a další

Témata: ddc:004, Min-Plus Convolution, Fine-grained Complexity, Conditional Lower Bounds, DATA processing & computer science, Approximation Schemes, Theory of computation → Approximation algorithms analysis

Popis souboru: application/pdf

The 2-Attractor Problem Is NP-Complete

Autoři: Fuchs, Janosch Whittington, Philip

Zdroj: 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

Témata: String attractors, Theory of computation → Approximation algorithms analysis, Theory of computation → Data compression, Theory of computation → Problems, reductions and completeness, computational complexity, dictionary compression

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400035

Dostupnost: https://publications.rwth-aachen.de/record/994994
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2024-09648%22

Noisy k-Means++ Revisited

Autoři: Grunau, Christoph Özüdoğru, Ahmet Alper Rozhoň, Václav a další

Přispěvatelé: Grunau, Christoph Özüdoğru, Ahmet Alper Rozhoň, Václav a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)

Témata: Theory of computation → Approximation algorithms analysis, Theory of computation → Unsupervised learning and clustering, Clustering, K-means, K-means++, Adversarial noise

Popis souboru: application/application/pdf

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

The 2-Attractor Problem Is NP-Complete

Autoři: Fuchs, Janosch Whittington, Philip Janosch Fuchs and Philip Whittington

Přispěvatelé: Fuchs, Janosch Whittington, Philip Janosch Fuchs and Philip Whittington

Zdroj: 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-14

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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2304.06523
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.35
https://publications.rwth-aachen.de/record/994994

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoři: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a další

Přispěvatelé: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a další

Zdroj: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

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

Geografické téma: Seattle, United States

Dostupnost: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

On the complexity of the data-driven wasserstein distributionally robust binary problem

Autoři: Kim, Hyoseok Watel, Dimitri Faye, Alain a další

Přispěvatelé: Kim, Hyoseok Watel, Dimitri Faye, Alain a další

Zdroj: https://hal.science/hal-04143445 ; 2023.

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

Dostupnost: https://hal.science/hal-04143445
https://hal.science/hal-04143445v1/document
https://hal.science/hal-04143445v1/file/01_STACS_2022_HAL.pdf
https://doi.org/10.4230/LIPIcs.CVIT.2016.23

Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals

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

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

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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2206.11807
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.14
http://eprints.lse.ac.uk/120416/

Sublinear-Round Parallel Matroid Intersection

Autoři: Blikstad, Joakim Joakim Blikstad Bojańczyk, Mikołaj a další

Přispěvatelé: Blikstad, Joakim Joakim Blikstad Bojańczyk, Mikołaj a další

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

Popis souboru: application/pdf

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

A Structural Investigation of the Approximability of Polynomial-Time Problems

Autoři: Bringmann, Karl Cassis, Alejandro Fischer, Nick a další

Přispěvatelé: Bringmann, Karl Cassis, Alejandro Fischer, Nick a další

Zdroj: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics

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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2204.11681
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.30
http://hdl.handle.net/21.11116/0000-000B-15B5-1
http://hdl.handle.net/21.11116/0000-000B-15B7-F

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

Autoři: Esmer, Barış Can Kulik, Ariel Marx, Dániel a další

Přispěvatelé: Esmer, Barış Can Kulik, Ariel Marx, Dániel a další

Zdroj: 30th Annual European Symposium on Algorithms
Leibniz International Proceedings in Informatics

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

Popis souboru: application/pdf

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

Breaking O(nr) for Matroid Intersection

Autoři: Blikstad, Joakim Joakim Blikstad Bansal, Nikhil a další

Přispěvatelé: Blikstad, Joakim Joakim Blikstad Bansal, Nikhil a další

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

Popis souboru: application/pdf

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

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More

Autoři: Gálvez, Waldo Grandoni, Fabrizio Khan, Arindam a další

Přispěvatelé: Gálvez, Waldo Grandoni, Fabrizio Khan, Arindam a další

Zdroj: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021

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

Popis souboru: application/pdf

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

Optimality of Geometric Local Search

Autoři: Jartoux, Bruno Mustafa, Nabil Laboratoire d'Informatique Gaspard-Monge (LIGM) a další

Přispěvatelé: Jartoux, Bruno Mustafa, Nabil Laboratoire d'Informatique Gaspard-Monge (LIGM) a další

Zdroj: 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⟩

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

Geografické téma: Budapest, Hungary

Dostupnost: https://hal.science/hal-01797822
https://hal.science/hal-01797822v1/document
https://hal.science/hal-01797822v1/file/p48-jartoux.pdf
https://doi.org/10.4230/LIPIcs.SoCG.2018.48

The Longest Run Subsequence Problem: Further Complexity Results

Autoři: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Přispěvatelé: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) a další

Zdroj: 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⟩

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

Geografické téma: Wrocław, Poland

Dostupnost: https://hal.science/hal-03457156
https://doi.org/10.4230/LIPIcs.CPM.2021.14

Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree.

Autoři: Traub, Vera Zenklusen, Rico

Zdroj: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-40, 40p

Témata: GREEDY algorithms, COMBINATORIAL optimization, TREES

Minimum Plane Bichromatic Spanning Trees.

Autoři: Akitaya, Hugo A. Biniaz, Ahmad Demaine, Erik D. a další

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-14, 14p

Témata: SPANNING trees, POLYNOMIAL time algorithms, APPROXIMATION algorithms

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.

Autoři: Cohen-Addad, Vincent Das, Debarati Kipouridis, Evangelos a další

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-41, 41p

Témata: POLYNOMIAL time algorithms, TREE graphs, APPROXIMATION algorithms