Výsledky vyhľadávania - Special Issue on Approximation and Online Algorithms

Special Issue on Approximation and Online Algorithms Autor Epstein, Leah, Erlebach, Thomas

Získať plný text

Correction to: Special Issue on Approximation and Online Algorithms Autor Epstein, Leah, Erlebach, Thomas

“…The original version of the article was inadvertently published with misinterpretations on author’s proof corrections on mathematical expressions…”
Získať plný text

Guest Editorial: Special Issue on Approximation and Online Algorithms Autor Solis-Oba, Roberto, Fleischer, Rudolf

Získať plný text

Special Issue on Approximation and Online Algorithms Autor Solis-Oba, Roberto, Persiano, Giuseppe

“…Issue Title: Approximation and Online Algorithms…”
Získať plný text

Special Issue on Approximation and Online Algorithms Autor Erlebach, Thomas, Persiano, Giuseppe

“…Issue Title: Approximation and Online Algorithms…”
Získať plný text

Approximation Results for Makespan Minimization with Budgeted Uncertainty Autor Bougeret, Marin, Jansen, Klaus, Poss, Michael, Rohwedder, Lars

“…We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs…”
Získať plný text

Managing Multiple Mobile Resources Autor Feldkord, Björn, Knollmann, Till, Malatyali, Manuel, Heide, Friedhelm Meyer auf der

“…, and moving a server induces costs proportional to the distance multiplied with a weight D . We show that, in our model, no online algorithm can have a constant competitive ratio: i.e…”
Získať plný text

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms Autor Gálvez, Waldo, Grandoni, Fabrizio, Jabal Ameli, Afrouz, Sornat, Krzysztof

“… (hence for k -Connectivity Augmentation in general). As a first step towards better approximation algorithms for CacAP, we consider the special case where the input cactus consists of a single cycle, the Cycle Augmentation Problem (CycAP…”
Získať plný text

Streaming Algorithms for Bin Packing and Vector Scheduling Autor Cormode, Graham, Veselý, Pavel

“… These are well understood in the traditional online and offline cases, but have been less well-studied when the volume of the input is truly massive, and cannot even be read into memory…”
Získať plný text

Deterministic Min-Cost Matching with Delays Autor Azar, Yossi, Jacob Fanani, Amit

“…We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016…”
Získať plný text

Preface Autor Bampis, Evripidis, Megow, Nicole

Získať plný text

Advice Complexity of Priority Algorithms Autor Borodin, Allan, Boyar, Joan, Larsen, Kim S., Pankratov, Denis

“…The priority model of “greedy-like” algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002…”
Získať plný text

Lower Bounds for Several Online Variants of Bin Packing Autor Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf

“…We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios…”
Získať plný text

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching Autor Borodin, Allan, Pankratov, Denis, Salehi-Abari, Amirali

“…We present a series of results regarding conceptually simple algorithms for bipartite matching in various online and related models…”
Získať plný text

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs Autor Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.

“… We show that the greedy algorithm is an optimal online algorithm for both problems. Typically, an online algorithm is proved to be an optimal online algorithm…”
Získať plný text

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals Autor Chang, Minjun, Hochbaum, Dorit S., Spaen, Quico, Velednitsky, Mark

“…We present an optimally-competitive algorithm for the problem of maximum online perfect bipartite matching with i.i.d. arrivals…”
Získať plný text

Longest Increasing Subsequence under Persistent Comparison Errors Autor Geissmann, Barbara

“… We present asymptotically tight upper and lower bounds on both the approximation factor…”
Získať plný text

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs Autor Laish, Itay, Mozes, Shay

“… )-approximation of the distance from v to the closest vertex with label λ in G . Such an oracle is dynamic if it also supports label changes…”
Získať plný text

On-line Search in Two-Dimensional Environment Autor Dereniowski, Dariusz, Osula, Dorota

“…We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their…”
Získať plný text

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms Autor Kaklamanis, Christos, Pruhs, Kirk

“…Issue Title: Approximation and Online Algorithms…”
Získať plný text