Suchergebnisse - Special Issue on Approximation and Online Algorithms

Special Issue on Approximation and Online Algorithms

Autoren: Leah Epstein Thomas Erlebach

Quelle: Theory of Computing Systems. 64:569-570

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00224-020-09970-z.pdf

Guest Editorial: Special Issue on Approximation and Online Algorithms

Autoren: Rudolf Fleischer Roberto Solis-Oba

Quelle: Theory of Computing Systems. 63:1755-1756

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00224-019-09952-w.pdf
https://link.springer.com/content/pdf/10.1007/s00224-019-09952-w.pdf
https://link.springer.com/article/10.1007/s00224-019-09952-w
https://dblp.uni-trier.de/db/journals/mst/mst63.html#Solis-ObaF19

Correction to: Special Issue on Approximation and Online Algorithms

Autoren: Leah Epstein Thomas Erlebach

Quelle: Theory of Computing Systems. 64:571-571

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00224-020-09972-x.pdf
https://link.springer.com/article/10.1007/s00224-020-09972-x
https://dblp.uni-trier.de/db/journals/mst/mst64.html#EpsteinE20a
https://link.springer.com/content/pdf/10.1007/s00224-020-09972-x.pdf

Special Issue on Approximation and Online Algorithms

Autoren: Thomas Erlebach Giuseppe Persiano

Quelle: Theory of Computing Systems. 56:135-136

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs00224-014-9589-x.pdf

Special Issue on Approximation and Online Algorithms

Autoren: Giuseppe Persiano Roberto Solis-Oba

Quelle: Theory of Computing Systems. 56:1-2

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs00224-014-9555-7.pdf
https://link.springer.com/content/pdf/10.1007/s00224-020-09970-z.pdf
https://paperity.org/p/59499253/special-issue-on-approximation-and-online-algorithms
https://rd.springer.com/article/10.1007%2Fs00224-014-9589-x
http://dblp.uni-trier.de/db/journals/mst/mst56.html#Solis-ObaP15
https://dblp.uni-trier.de/db/journals/mst/mst64.html#EpsteinE20
https://link.springer.com/article/10.1007/s00224-014-9589-x/fulltext.html

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms

Autoren: Kirk Pruhs Christos Kaklamanis

Quelle: Theory of Computing Systems. 58:1-3

Schlagwörter: 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs00224-015-9619-3.pdf
https://link.springer.com/content/pdf/10.1007%2Fs00224-015-9619-3.pdf
https://dblp.uni-trier.de/db/journals/mst/mst58.html#KaklamanisP16
https://paperity.org/p/61352615/foreword-of-the-special-issue-dedicated-to-the-2013-workshop-on-approximation-and-online
https://link.springer.com/article/10.1007/s00224-015-9619-3

Special Issue on Approximation and Online Algorithms.

Autoren: Epstein, Leah Erlebach, Thomas

Quelle: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p569-570, 2p

Schlagwörter: APPROXIMATION algorithms, MATHEMATICAL proofs, DETERMINISTIC algorithms, ONLINE algorithms, METRIC spaces, ASSIGNMENT problems (Programming), PLANAR graphs

Guest Editorial: Special Issue on Approximation and Online Algorithms.

Autoren: Solis-Oba, Roberto Fleischer, Rudolf

Quelle: Theory of Computing Systems; Nov2019, Vol. 63 Issue 8, p1755-1756, 2p

Schlagwörter: ONLINE algorithms, APPROXIMATION algorithms, BIN packing problem, PLANAR graphs, BIPARTITE graphs

Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems

Autoren: Devanur, Nikhil R. Jain, Kamal Sivan, Balasubramanian et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1903.03944

Preface.

Autoren: Bampis, Evripidis Megow, Nicole

Quelle: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p901-902, 2p

Schlagwörter: ONLINE algorithms, BIN packing problem, GREEDY algorithms, APPROXIMATION algorithms, DETERMINISTIC algorithms

Special Issue on Approximation and Online Algorithms.

Autoren: Solis-Oba, Roberto Persiano, Giuseppe

Quelle: Theory of Computing Systems; Jan2015, Vol. 56 Issue 1, p1-2, 2p

Schlagwörter: ONLINE algorithms, APPROXIMATION theory

Special Issue on Approximation and Online Algorithms.

Autoren: Erlebach, Thomas Persiano, Giuseppe

Quelle: Theory of Computing Systems; Jan2015, Vol. 56 Issue 1, p135-136, 2p

Schlagwörter: ONLINE algorithms, APPROXIMATION theory

Correction to: Special Issue on Approximation and Online Algorithms.

Autoren: Epstein, Leah Erlebach, Thomas

Quelle: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p571-571, 1p

Schlagwörter: ONLINE algorithms, APPROXIMATION algorithms, MATHEMATICAL proofs

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue.

Autoren: Bansal, Nikhil Kim, Eun Jung Nagarajan, Viswanath et al.

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

Schlagwörter: DATA structures, ONLINE algorithms, INDEPENDENT sets, LOGISTIC regression analysis, OPEN-ended questions, LOW density parity check codes

Selected Algorithmic Papers from the International Workshop on Combinatorial Algorithms 2024.

Autoren: Rescigno, Adele Anna

Quelle: Algorithms; Jun2025, Vol. 18 Issue 6, p328, 2p

Schlagwörter: POLYNOMIAL time algorithms, GRAPH theory, ONLINE algorithms, PARALLEL algorithms, DISTRIBUTION (Probability theory), BIPARTITE graphs, HYPERGRAPHS, APPROXIMATION algorithms

Special issue "Discrete optimization: Theory, algorithms and new applications".

Autoren: Werner, Frank

Quelle: AIMS Mathematics; 2024, Vol. 9 Issue 3, p1-4, 4p

Schlagwörter: MATHEMATICAL optimization, METAHEURISTIC algorithms, ONLINE algorithms, LINEAR matrix inequalities, ALGORITHMS, ROBUST stability analysis, NONLINEAR integral equations

Special issue on approximation algorithms: part 2

Autoren: Woeginger, Gerhard J.

Quelle: Journal of Scheduling ; volume 3, issue 6, page 321-322 ; ISSN 1094-6136 1099-1425

Verfügbarkeit: https://doi.org/10.1002/1099-1425(200011/12)3:6%3C321::aid-jos51%3E3.0.co%3B2-j
https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2F1099-1425(200011%2F12)3:6%3C321::AID-JOS51%3E3.0.CO%3B2-J
https://onlinelibrary.wiley.com/doi/full/10.1002/1099-1425(200011/12)3:6%3C321::AID-JOS51%3E3.0.CO%3B2-J

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms.

Autoren: Kaklamanis, Christos Pruhs, Kirk

Quelle: Theory of Computing Systems; Jan2016, Vol. 58 Issue 1, p1-3, 3p

Schlagwörter: PREFACES & forewords, CONFERENCES & conventions, APPROXIMATION theory, ONLINE algorithms, EXISTENCE theorems

Special Issue on Approximation Algorithms: Part 1

Autoren: Woeginger, Gerhard J.

Quelle: Journal of Scheduling ; volume 3, issue 5, page 247-247 ; ISSN 1094-6136 1099-1425

Verfügbarkeit: https://doi.org/10.1002/1099-1425(200009/10)3:5%3C247::aid-jos45%3E3.0.co%3B2-e
https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2F1099-1425(200009%2F10)3:5%3C247::AID-JOS45%3E3.0.CO%3B2-E
https://onlinelibrary.wiley.com/doi/full/10.1002/1099-1425(200009/10)3:5%3C247::AID-JOS45%3E3.0.CO%3B2-E

Approximation and Online Algorithms

Autoren: Jannik Matuschke José Verschae

Resource Type: eBook.

Schlagworte: Approximation algorithms--Congresses, Online algorithms--Congresses

Categories: MATHEMATICS / Numerical Analysis