|
Journals in DBLP
J. Algorithms 2005, volume: 55, number: 1
- Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
An online throughput-competitive algorithm for multicast routing and admission control. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:1-20 [Journal]
- Michael Filaseta, Douglas B. Meade
Irreducibility testing of lacunary 0, 1-polynomials. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:21-28 [Journal]
- Petra Sparl, Janez Zerovnik
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:29-41 [Journal]
- Yoo Ah Kim
Data migration to minimize the total completion time. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:42-57 [Journal]
- Graham Cormode, S. Muthukrishnan
An improved data stream summary: the count-min sketch and its applications. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:58-75 [Journal]
- Reuven Bar-Yehuda, Guy Even, Shimon Shahar
On approximating a geometric prize-collecting traveling salesman problem with time windows. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:76-92 [Journal]
- Moni Naor
On fairness in the carpool problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:55, n:1, pp:93-98 [Journal]
|