Suchergebnisse - Special Issue on Approximation and Online Algorithms

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

Volltext

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

“… The original version of the article was inadvertently published with misinterpretations on author’s proof corrections on mathematical expressions …”
Volltext

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

Volltext

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

“… Issue Title: Approximation and Online Algorithms …”
Volltext

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

“… Issue Title: Approximation and Online Algorithms …”
Volltext

Approximation Results for Makespan Minimization with Budgeted Uncertainty von 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 …”
Volltext

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms von 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 …”
Volltext

Streaming Algorithms for Bin Packing and Vector Scheduling von 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 …”
Volltext

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

“… We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016 …”
Volltext

Preface von Bampis, Evripidis, Megow, Nicole

Volltext

Advice Complexity of Priority Algorithms von 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 …”
Volltext

Lower Bounds for Several Online Variants of Bin Packing von 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 …”
Volltext

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching von 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 …”
Volltext

Managing Multiple Mobile Resources von 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 …”
Volltext

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs von 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 …”
Volltext

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals von 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 …”
Volltext

Longest Increasing Subsequence under Persistent Comparison Errors von Geissmann, Barbara

“… We present asymptotically tight upper and lower bounds on both the approximation factor …”
Volltext

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs von 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 …”
Volltext

On-line Search in Two-Dimensional Environment von 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 …”
Volltext

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

“… Issue Title: Approximation and Online Algorithms …”
Volltext