Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
Approximation techniques for average completion time scheduling
Authors:
Chekuri, C Motwani, R Natarajan, B Stein, C
Citation:
C. Chekuri et al., Approximation techniques for average completion time scheduling, SIAM J COMP, 31(1), 2001, pp. 146-166
Conjunctive query containment revisited
Authors:
Chekuri, C Rajaraman, A
Citation:
C. Chekuri et A. Rajaraman, Conjunctive query containment revisited, THEOR COMP, 239(2), 2000, pp. 211-229
Performance guarantees for the TSP with a parameterized triangle inequality
Authors:
Bender, MA Chekuri, C
Citation:
Ma. Bender et C. Chekuri, Performance guarantees for the TSP with a parameterized triangle inequality, INF PROCESS, 73(1-2), 2000, pp. 17-21
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Authors:
Chekuri, C Motwani, R
Citation:
C. Chekuri et R. Motwani, Precedence constrained scheduling to minimize sum of weighted completion times on a single machine, DISCR APP M, 98(1-2), 1999, pp. 29-38
Approximation algorithms for directed Steiner problems
Authors:
Charikar, M Chekuri, C Cheung, TY Dai, Z Goel, A Guha, S Li, M
Citation:
M. Charikar et al., Approximation algorithms for directed Steiner problems, J ALGORITHM, 33(1), 1999, pp. 73-91
Fast estimation of diameter and shortest paths (without matrix multiplication)
Authors:
Aingworth, D Chekuri, C Indyk, P Motwani, R
Citation:
D. Aingworth et al., Fast estimation of diameter and shortest paths (without matrix multiplication), SIAM J COMP, 28(4), 1999, pp. 1167-1181
Risultati:
1-6
|