Suchergebnisse - Mathematics of computing → Approximation algorithms
-
1
Resource Type: eBook.
Schlagworte: Characteristic functions, Approximation theory, Polynomials
Categories: SCIENCE / Physics / Mathematical & Computational
PDF-Volltext -
2
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 -
3
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
-
4
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
-
5
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
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Communications in Computational Physics
Proceedings of the Platform for Advanced Scientific Computing Conference on-PASC '18
Proceedings of the Platform for Advanced Scientific Computing ConferenceSchlagwörter: FOS: Computer and information sciences, Parallel algorithms, Computations on matrices, Mathematics of computing, 01 natural sciences, Computing methodologies, Supercomputadors, Informàtica [Àrees temàtiques de la UPC], Massively parallel algorithms, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, Theory of computation, Numeric approximation algorithms, Applied computing, Mathematics - Rings and Algebras, Numerical Analysis (math.NA), Algorismes paral·lels, Computer Science - Distributed, Parallel, and Cluster Computing, Rings and Algebras (math.RA), Distributed algorithms, Computer Science - Mathematical Software, Distributed, Parallel, and Cluster Computing (cs.DC), Àrees temàtiques de la UPC::Informàtica, Computational methods in engineering, Mathematical Software (cs.MS)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/pdf/1703.02456
https://upcommons.upc.edu/bitstream/2117/120202/1/A%20Massively%20Parallel%20Algorithm%20for%20the%20Approximate%20Calculation.pdf
http://arxiv.org/abs/1703.02456
http://arxiv.org/abs/1710.10899
http://hdl.handle.net/2117/120202
http://export.arxiv.org/pdf/1710.10899
https://arxiv.org/pdf/1710.10899
https://arxiv.org/abs/1710.10899
https://ui.adsabs.harvard.edu/abs/2017arXiv171010899L/abstract
https://ui.adsabs.harvard.edu/abs/2017arXiv170302456R/abstract
https://arxiv.org/pdf/1703.02456.pdf
https://www.arxiv.org/abs/1703.02456
https://hdl.handle.net/2117/120202
https://doi.org/10.1145/3218176.3218231 -
7
Autoren:
Quelle: SIAM Review, 2005 Dec 01. 47(4), 629-705.
Zugangs-URL: https://www.jstor.org/stable/20453700
-
8
Autoren:
Quelle: AUT Journal of Mathematics and Computing, Vol 1, Iss 2, Pp 145-152 (2020)
Schlagwörter: approximation algorithm, complexity, np-hard problems, directed multi-multiway cut, directed multicut cut, Mathematics, QA1-939
Dateibeschreibung: electronic resource
-
9
Autoren:
Quelle: AUT Journal of Mathematics and Computing, Vol 1, Iss 1, Pp 47-55 (2020)
Schlagwörter: computational geometry, approximation algorithms, unit disk cover problem, facility location, Mathematics, QA1-939
Dateibeschreibung: electronic resource
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Lecture Notes in Computer Science ISBN: 9783540221135
Schlagwörter: Optimization, 150399 Business and Management not elsewhere classified, 20E28, Numerical Analysis, Science, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Calculus of Variations and Optimal Control, 01 natural sciences, FOS: Economics and business, Combinatorics, Mathematical and Computational Physics, Mathematical Methods in Physics, 20G40, Mathematics of Computing, Mathematics, 20C20
Dateibeschreibung: 201436 bytes; 3115 bytes; application/pdf; text/plain
Zugangs-URL: http://deepblue.lib.umich.edu/bitstream/2027.42/45871/1/10107_2005_Article_673.pdf
https://link.springer.com/10.1007/978-3-540-25960-2_8
https://rd.springer.com/chapter/10.1007/978-3-540-25960-2_8
https://core.ac.uk/display/24478781
https://link.springer.com/chapter/10.1007%2F978-3-540-25960-2_8
https://dblp.uni-trier.de/db/conf/ipco/ipco2004.html#RaviS04 -
11
Autoren: Ye, Yinyu
Quelle: Mathematics of Operations Research, 1993 May 01. 18(2), 334-345.
Zugangs-URL: https://www.jstor.org/stable/3690284
-
12
Weitere Verfasser: Dubey, Pradeep
Quelle: SIAM Journal on Scientific Computing; 38; 5
Dateibeschreibung: Medium: X; Size: p. S593-S619
Zugangs-URL: http://www.osti.gov/scitech/biblio/1337238
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Mathematical Software. 46:1-27
Schlagwörter: [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, Numeric approximation algorithms, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Fast Fourier Transform, Floating-point arithmetic, 01 natural sciences, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Rounding error analysis, • Theory of computation → Design and analysis of algorithms, Additional Key Words and Phrases: Floating-point arithmetic, Rounding error analysis ACM Reference format, CCS Concepts: • Mathematics of computing → Mathematical software, [INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic, 0101 mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01949458v2/file/Bounds-FFT-HaLV2-oct19.pdf
https://hal.science/hal-01949458v2/document
https://doi.org/10.1145/3368619
https://hal.science/hal-01949458v2
https://hal.archives-ouvertes.fr/hal-01949458/document
https://doi.org/10.1145/3368619
https://hal.archives-ouvertes.fr/hal-01949458
https://dblp.uni-trier.de/db/journals/toms/toms46.html#BrisebarreJMNP20
https://dl.acm.org/doi/abs/10.1145/3368619 -
14
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-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
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
16
Autoren:
Quelle: Journal of Computational and Applied Mathematics. 450
Schlagwörter: Arnoldi algorithm, Control problems, Heat equation, Inverse problems, Low rank approximations, Parabolic PDEs, Approximation algorithms, Approximation theory, Initial value problems, Numerical methods, Partial differential equations, Direct problems, Heat sources, Initial-value problem, Linear parabolic equation, Parabolics
Dateibeschreibung: print
-
17
Weitere Verfasser: Ying, Weiqin [South China Univ. of Technology (People's Republic of China)]
Quelle: Theoretical Computer Science; 609; P2
Dateibeschreibung: Medium: ED; Size: p. 434-442
Zugangs-URL: http://www.osti.gov/scitech/servlets/purl/1331085
-
18
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
-
19
Autoren:
Quelle: AUT Journal of Mathematics and Computing, Vol 1, Iss 2, Pp 145-152 (2020)
Schlagwörter: FOS: Computer and information sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), directed multicut cut, 01 natural sciences, np-hard problems, Computer Science - Computational Complexity, directed multi-multiway cut, Computer Science - Data Structures and Algorithms, QA1-939, Data Structures and Algorithms (cs.DS), complexity, approximation algorithm, Mathematics
Zugangs-URL: http://arxiv.org/abs/1610.02336
https://doaj.org/article/d2762e109fd0469995c030d40fb878b0
https://ajmc.aut.ac.ir/article_3810.html
https://ajmc.aut.ac.ir/article_3810_5e4da5297ba5154b4c1b08186e4dbb8e.pdf
http://ui.adsabs.harvard.edu/abs/2016arXiv161002336Y/abstract
https://arxiv.org/abs/1610.02336 -
20
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]
Nájsť tento článok vo Web of Science 
Full Text Finder