AAAAAA
Results:
1-9
|
Results: 9
Authors:
Bar-Noy, A
Guha, S
Naor, JS
Schieber, B
Citation: A. Bar-noy et al., Approximating the throughput of multiple machines in real-time scheduling, SIAM J COMP, 31(2), 2001, pp. 331-352
Authors:
Naor, JS
Zosin, L
Citation: Js. Naor et L. Zosin, A 2-approximation algorithm for the directed multiway cut problem, SIAM J COMP, 31(2), 2001, pp. 477-482
Authors:
Bar-Noy, A
Freund, A
Naor, JS
Citation: A. Bar-noy et al., On-line load balancing in a hierarchical server topology, SIAM J COMP, 31(2), 2001, pp. 527-549
Authors:
Naor, JS
Orda, A
Petruschka, Y
Citation: Js. Naor et al., Dynamic storage allocation with known durations, DISCR APP M, 100(3), 2000, pp. 203-213
Authors:
Even, G
Naor, JS
Schieber, B
Zosin, L
Citation: G. Even et al., Approximating minimum subset feedback sets in undirected graphs with applications, SIAM J DISC, 13(2), 2000, pp. 255-267
Authors:
Bhatia, R
Khuller, S
Naor, JS
Citation: R. Bhatia et al., The loading time scheduling problem, J ALGORITHM, 36(1), 2000, pp. 1-33
Authors:
Even, G
Naor, JS
Zosin, L
Citation: G. Even et al., An 8-approximation algorithm for the subset feedback vertex set problem, SIAM J COMP, 30(4), 2000, pp. 1231-1252
Authors:
Even, G
Naor, JS
Rao, S
Schieber, B
Citation: G. Even et al., Fast approximate graph partitioning algorithms, SIAM J COMP, 28(6), 1999, pp. 2187-2214
Authors:
Khuller, S
Moss, A
Naor, JS
Citation: S. Khuller et al., The budgeted maximum coverage problem, INF PROCESS, 70(1), 1999, pp. 39-45
Risultati:
1-9
|