Fast Approximation Algorithms for Fractional Packing and Covering Problems von Plotkin, Serge A, Shmoys, David B, Tardos, Eva

Volltext

Approximation Algorithms for Steiner and Directed Multicuts von Klein, Philip N, Plotkin, Serge A, Rao, Satish, Tardos, Éva

Volltext

Combinatorial Algorithms for the Generalized Circulation Problem von Goldberg, Andrew V, Plotkin, Serge A, Tardos, Eva

Volltext

Polynomial dual network simplex algorithms von ORLIN, J. B, PLOTKIN, S. A, TARDOS, E

Volltext

Using interior-point methods for fast parallel algorithms for bipartite matching and related problems von GOLDBERG, A. V, PLOTKIN, S. A, SHMOYS, D. B, TARDOS, E

Volltext

Using separation algorithms in fixed dimension von Norton, Carolyn Haibt, Plotkin, Serge A, Tardos, Éva

Volltext

Minimum-cost spanning tree as a path-finding problem von Maggs, Bruce M., Plotkin, Serge A.

Volltext

Parallel (Δ + 1)-coloring of constant-degree graphs von Goldberg, Andrew V., Plotkin, Serge A.

Volltext

Time-lapse snapshots von Dwork, Cynthia, Herlihy, Maurice, Plotkin, Serge A., Waarts, Orli

Volltext

Parallel Symmetry-Breaking in Sparse Graphs von Goldberg, Andrew V., Plotkin, Serge A., Shannon, Gregory E.

Volltext

A sublinear parallel algorithm for stable matching von FEDER, T, MEGIDDO, N, PLOTKIN, S. A

Volltext

A parallel algorithm for reconfiguring a multibutterfly network with faulty switches von Goldberg, A.V., Maggs, B.M., Plotkin, S.A.

Volltext

Sublinear-Time Parallel Algorithms for Matching and Related Problems von Goldberg, A.V., Plotkin, S.A., Vaidya, P.M.

Volltext

Graph-Theoretic Techniques for Parallel, Distributed, and Sequential Computation von Plotkin, Serge A

Volltext bestellen

Approximating the Size of a Dynamically Growing Asynchronous Distributed Network von Awerbuch, Baruch, Plotkin, Serge A

Volltext bestellen

Network decomposition and locality in distributed computation von Awerbuch, B., Luby, M., Goldberg, A.V., Plotkin, S.A.

Volltext bestellen

Fast approximation algorithms for fractional packing and covering problems von Plotkin, S.A., Shmoys, D.B., Tardos, E.

Volltext bestellen

Efficient Parallel Algorithms for (5+1)-Coloring and Maximal Independent Set Problems von Goldberg,Andrew V, Plotkin,Serge A

Volltext bestellen

Parallel (Delta + 1) Coloring of Constant-Degree Graphs von Goldberg,Andrew V, Plotkin,Serge A

Volltext bestellen

Local management of a global resource in a communication network von Afek, Yehuda, Awerbuch, Baruch, Plotkin, Serge A., Saks, Michael

Volltext