Výsledky vyhledávání - "Special Issue on Approximation and Online Algorithms"

Special Issue on Approximation and Online Algorithms

Autoři: Leah Epstein Thomas Erlebach

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

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s00224-020-09970-z.pdf

Guest Editorial: Special Issue on Approximation and Online Algorithms

Autoři: Rudolf Fleischer Roberto Solis-Oba

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

Témata: 0102 computer and information sciences, 01 natural sciences

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

Autoři: Leah Epstein Thomas Erlebach

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

Témata: 0102 computer and information sciences, 01 natural sciences

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

Autoři: Thomas Erlebach Giuseppe Persiano

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

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs00224-014-9589-x.pdf

Special Issue on Approximation and Online Algorithms

Autoři: Giuseppe Persiano Roberto Solis-Oba

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

Témata: 0102 computer and information sciences, 01 natural sciences

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

Special Issue on Approximation and Online Algorithms.

Autoři: Epstein, Leah Erlebach, Thomas

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

Témata: APPROXIMATION algorithms, MATHEMATICAL proofs, DETERMINISTIC algorithms, ONLINE algorithms, METRIC spaces, ASSIGNMENT problems (Programming), PLANAR graphs

Guest Editorial: Special Issue on Approximation and Online Algorithms.

Autoři: Solis-Oba, Roberto Fleischer, Rudolf

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

Témata: ONLINE algorithms, APPROXIMATION algorithms, BIN packing problem, PLANAR graphs, BIPARTITE graphs

Correction to: Special Issue on Approximation and Online Algorithms.

Autoři: Epstein, Leah Erlebach, Thomas

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

Témata: ONLINE algorithms, APPROXIMATION algorithms, MATHEMATICAL proofs

Special Issue on Approximation and Online Algorithms.

Autoři: Solis-Oba, Roberto Persiano, Giuseppe

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

Témata: ONLINE algorithms, APPROXIMATION theory

Special Issue on Approximation and Online Algorithms.

Autoři: Erlebach, Thomas Persiano, Giuseppe

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

Témata: ONLINE algorithms, APPROXIMATION theory

Preface.

Autoři: Bampis, Evripidis Megow, Nicole

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

Témata: ONLINE algorithms, BIN packing problem, GREEDY algorithms, APPROXIMATION algorithms, DETERMINISTIC algorithms

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs.

Autoři: Liu, Fu-Hong Liu, Hsiang-Hsuan Wong, Prudence W. H.

Zdroj: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p1009-1032, 24p

Témata: ONLINE algorithms, GREEDY algorithms, ASSIGNMENT problems (Programming), SCHEDULING, SUPPLEMENTARY employment

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.

Autoři: Gálvez, Waldo Grandoni, Fabrizio Jabal Ameli, Afrouz a další

Zdroj: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p985-1008, 24p

Témata: HARDNESS, CACTUS, APPROXIMATION algorithms

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

Autoři: Bougeret, Marin Jansen, Klaus Poss, Michael a další

Zdroj: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p903-915, 13p

Témata: BATCH processing, APPROXIMATION algorithms, UNCERTAINTY, PRODUCTION scheduling, ALGORITHMS, ROBUST optimization, ONLINE algorithms

Managing Multiple Mobile Resources.

Autoři: Feldkord, Björn Knollmann, Till Malatyali, Manuel a další

Zdroj: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p943-984, 42p

Témata: ONLINE algorithms, ALGORITHMS, DETERMINISTIC algorithms, EUCLIDEAN distance, MATHEMATICS

Geografický termín: THAILAND

Streaming Algorithms for Bin Packing and Vector Scheduling.

Autoři: Cormode, Graham Veselý, Pavel

Zdroj: Theory of Computing Systems; Aug2021, Vol. 65 Issue 6, p916-942, 27p

Témata: BIN packing problem, COMBINATORIAL optimization, ALGORITHMS, SCHEDULING, PRODUCTION scheduling

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.

Autoři: Chang, Minjun Hochbaum, Dorit S. Spaen, Quico a další

Zdroj: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p645-661, 17p

Témata: BIPARTITE graphs, EXPECTED utility, ONLINE algorithms

Longest Increasing Subsequence under Persistent Comparison Errors.

Autoři: Geissmann, Barbara

Zdroj: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p662-680, 19p

Témata: APPROXIMATION algorithms

Deterministic Min-Cost Matching with Delays.

Autoři: Azar, Yossi Jacob Fanani, Amit

Zdroj: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p572-592, 21p

Témata: DETERMINISTIC algorithms, METRIC spaces, ONLINE algorithms, SPACETIME

Approximating Node-Weighted k-MST on Planar Graphs.

Autoři: Byrka, Jarosław Lewandowski, Mateusz Spoerhase, Joachim

Zdroj: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p626-644, 19p

Témata: PLANAR graphs, SPANNING trees, MATHEMATICS, APPROXIMATION algorithms, ALGORITHMS