Suchergebnisse - "Mathematics of computing → Approximation algorithms"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Computation Theory. 16:1-18
Schlagwörter: FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, Discrete Mathematics (cs.DM), subexponential-time algorithm, Mathematics of computing → Graph algorithms, 4. Education, 7. Clean energy, subdivided claw, Max Independent Set, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, QPTAS, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 244
30th Annual European Symposium on Algorithms (ESA 2022)Schlagwörter: Mathematics of computing → Approximation algorithms, metric embeddings, Theory of computation → Random projections and metric embeddings, online algorithms, Tree metrics, 0102 computer and information sciences, deterministic algorithm, 16. Peace & justice, group Steiner tree, 01 natural sciences, 7. Clean energy, Tree Metrics, approximation algorithms, group Steiner forest, demand-robust algorithms, Mathematics of computing → Paths and connectivity problems, ddc:004, Mathematics of computing → Trees, deterministic algorithms
Dateibeschreibung: application/pdf; application/application/pdf
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 30th Annual European Symposium on Algorithms
Leibniz International Proceedings in InformaticsSchlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-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 -
4
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: constant-factor approximation algorithm, FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, Constant-factor approximation algorithm, Outerplanar graphs, LOCAL model, dominating set, 0102 computer and information sciences, 01 natural sciences, Dominating set, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004
Dateibeschreibung: application/pdf
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩Schlagwörter: 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]
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: European Symposium on Algorithms ; https://hal.science/hal-04789244 ; European Symposium on Algorithms, Sep 2023, Amsterdam, Netherlands. ⟨10.4230/LIPIcs.ESA.2023.71⟩
Schlagwörter: Tournaments, Graph Coloring, Algorithms, Complexity, Mathematics of computing → Approximation algorithms, [INFO]Computer Science [cs]
Geographisches Schlagwort: Amsterdam, Netherlands
Full Text Finder 
Nájsť tento článok vo Web of Science