Works matching IS 14324350 AND DT 2009 AND VI 45 AND IP 3

Results: 12

Competitive Online Multicommodity Routing.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 533, doi. 10.1007/s00224-009-9187-5

By:

Harks, Tobias;
Heinz, Stefan;
Pfetsch, Marc E.

Publication type:

Article

WAOA 2006 Special Issue of TOCS.

Published in:

2009

By:

Erlebach, Thomas;
Kaklamanis, Christos

Publication type:

Editorial

On the Black-Box Complexity of Sperner’s Lemma.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 629, doi. 10.1007/s00224-008-9121-2

By:

Friedl, Katalin;
Ivanyos, Gábor;
Santha, Miklos;
Verhoeven, Yves F.

Publication type:

Article

The Complexity of Finding SUBSEQ( A).

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 577, doi. 10.1007/s00224-008-9111-4

By:

Fenner, Stephen;
Gasarch, William;
Postow, Brian

Publication type:

Article

Online k-Server Routing Problems.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 470, doi. 10.1007/s00224-008-9103-4

By:

Bonifaci, Vincenzo;
Stougie, Leen

Publication type:

Article

A Randomized Algorithm for Online Unit Clustering.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 486, doi. 10.1007/s00224-007-9085-7

By:

Chan, Timothy M.;
Zarrabi-Zadeh, Hamid

Publication type:

Article

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 555, doi. 10.1007/s00224-008-9112-3

By:

Athanassopoulos, Stavros;
Caragiannis, Ioannis;
Kaklamanis, Christos

Publication type:

Article

Quantum Algorithms for Matching Problems.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 613, doi. 10.1007/s00224-008-9118-x

By:

Dörn, Sebastian

Publication type:

Article

Covering Many or Few Points with Unit Disks.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 446, doi. 10.1007/s00224-008-9135-9

By:

de Berg, Mark;
Cabello, Sergio;
Har-Peled, Sariel

Publication type:

Article

Network Design with Edge-Connectivity and Degree Constraints.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 512, doi. 10.1007/s00224-008-9149-3

By:

Fukunaga, Takuro;
Nagamochi, Hiroshi

Publication type:

Article

Online Dynamic Programming Speedups.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 429, doi. 10.1007/s00224-009-9166-x

By:

Bar-Noy, Amotz;
Golin, Mordecai;
Yan Zhang

Publication type:

Article

On Hierarchical Diameter-Clustering and the Supplier Problem.

Published in:

Theory of Computing Systems, 2009, v. 45, n. 3, p. 497, doi. 10.1007/s00224-009-9186-6

By:

Das, Aparna;
Kenyon-Mathieu, Claire

Publication type:

Article