Treffer 1 - 20
von 11.230
- 1
- 2
Seite in der Trefferliste auswählen
Lectures on proof verification and approximation algorithms
Computers & Mathematics with Applications ; volume 36, issue 6, page 144 ; ISSN 0898-1221
Pliability and Approximating Max-CSPs.
ROMERO, MIGUEL ; WROCHNA, MARCIN ; ŽIVNÝ, STANISLAV
Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-43. 43p.
Dieses Ergebnis kann Gästen nicht angezeigt werden.
Login für vollen Zugriff.
Lectures on Proof Verification and Approximation Algorithms
Mayr, Ernst W. ; Jürgen Prömel, Hans ; Steger, Angelika
Lecture Notes in Computer Science ; ISSN 0302-9743 1611-3349 ; ISBN 9783540642015 9783540697015
Semidefinite Programming and its Applications to Approximation Algorithms
Lectures on proof verification and approximation algorithms
Hofmeister, T. ; Huehne, M.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):263-298
Introduction to the Theory of Complexity and Approximation Algorithms
Lectures on proof verification and approximation algorithms
Jansen, T.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):5-28
Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design.
Gupta, Anupam ; Kumar, Amit ; Pál, Martin ; et al.
Journal of the ACM. Jun2007, Vol. 54 Issue 3, p1-38. 38p. 3 Illustrations, 1 Diagram, 1 Chart, 1 Graph.
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces
Lectures on proof verification and approximation algorithms
Mayr, R. ; Schelten, A.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):313-323
Proof Checking and Non-Approximability
Lectures on proof verification and approximation algorithms
Hougardy, S.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):63-82
Introduction to Randomized Algorithms
Lectures on proof verification and approximation algorithms
Andrzejak, A.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):29-40
VERIFIED APPROXIMATION ALGORITHMS.
ESSMANN, ROBIN ; NIPKOW, TOBIAS ; ROBILLARD, SIMON ; et al.
Logical Methods in Computer Science (LMCS); 2022, Vol. 18 Issue 1, p1-21, 21p
CORRELATION DECAY AND PARTITION FUNCTION ZEROS: ALGORITHMS AND PHASE TRANSITIONS.
JINGCHENG LIU ; SINCLAIR, ALISTAIR ; SRIVASTAVA, PIYUSH
SIAM Journal on Computing; 2025, Vol. 54 Issue 4, p200-252, 53p
A convex dual problem for the rational minimax approximation and Lawson's iteration.
Zhang, Lei-Hong ; Yang, Linyi ; Yang, Wei Hong ; et al.
Mathematics of Computation; Sep2025, Vol. 94 Issue 355, p2457-2494, 38p
Bounded satisfiability checking of FOL∗ formulas with aggregations.
Feng, Nick ; Marsso, Lina ; Kholodetska, Yuliia ; et al.
Formal Methods in System Design; Dec2025, Vol. 67 Issue 3, p282-315, 34p
Two-Sided Convexity Testing with Certificates.
Dumitrescu, Adrian
Studia Scientiarum Mathematicarum Hungarica; Jun2024, Vol. 61 Issue 2, p116-133, 18p
ON THE MYSTERIES OF MAX NAE-SAT.
BRAKENSIEK, JOSHUA ; NENG HUANG ; POTECHIN, AARON ; et al.
SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 1, p267-313, 47p
On the Sum-of-Squares Algorithm for Bin Packing.
Csirik, Janos ; Johnson, David S. ; Kenyon, Claire ; et al.
Journal of the ACM. Jan2006, Vol. 53 Issue 1, p1-65. 65p.
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms.
Holzmann, Tim ; Smith, J. Cole
Operations Research. Jan/Feb2021, Vol. 69 Issue 1, p82-99. 18p. 3 Diagrams, 8 Charts, 2 Graphs.
DYNAMIC TIME WARPING UNDER TRANSLATION: APPROXIMATION GUIDED BY SPACE-FILLING CURVES.
Bringmann, Karl ; Kisfaludi-Bak, Sándor ; Künnemann, Marvin ; et al.
Journal of Computational Geometry; 2023, Vol. 14 Issue 2, p83-107, 25p
Optimal Non-Approximability of MAXCLIQUE
Lectures on proof verification and approximation algorithms
Mundhenk, M. ; Slobodova, A.
LECTURE NOTES IN COMPUTER SCIENCE. (1367):235-248
- 1
- 2