Theory of Computing Systems

The original version of the article was inadvertently published with misinterpretations on author’s proof corrections on mathematical expressions.

We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is given, and requests for points in space are submitted in different times in this space by an ...$\mathrm{}$$\left(\right)$$\left(\frac{\mathrm{}}{}{}^{{\mathrm{}}_{\mathrm{}}\left(\frac{\mathrm{}}{\mathrm{}}\right)}\right)$$\left({}^{\mathrm{}}\right)$

The priority model of “greedy-like” algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advice, i.e., side information precomputed by an all-powerful oracle. ...

We study the problem of finding a minimum weight connected subgraph spanning at least k vertices on planar, node-weighted graphs. We give a (4 + ε)-approximation algorithm for this problem. We achieve this by utilizing the recent Lagrangian-...

We present an optimally-competitive algorithm for the problem of maximum online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a known set of workers, a distribution over job types, and non-negative utility weights ...

We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel (Noisy sorting without resampling, SODA 2008, pages 268–...$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}\mathrm{}$$\mathrm{}$$\mathrm{}\mathrm{}$