AAAAAA
Results:
1-9
|
Results: 9
Authors:
Krumke, SO
Marathe, MV
Noltemeier, H
Ravi, SS
Wirth, HC
Citation: So. Krumke et al., Upgrading bottleneck constrained forests, DISCR APP M, 108(1-2), 2001, pp. 129-142
Authors:
Krumke, SO
Marathe, MV
Ravi, SS
Citation: So. Krumke et al., Models and approximation algorithms for channel assignment in radio networks, WIREL NETW, 7(6), 2001, pp. 575-584
Authors:
Arikati, SR
Dessmark, A
Lingas, A
Marathe, MV
Citation: Sr. Arikati et al., Approximation algorithms for maximum two-dimensional pattern matching, THEOR COMP, 255(1-2), 2001, pp. 51-62
Authors:
Ravi, R
Marathe, MV
Ravi, SS
Rosenkrantz, DJ
Hunt, HB
Citation: R. Ravi et al., Approximation algorithms for degree-constrained minimum-cost network-design problems, ALGORITHMIC, 31(1), 2001, pp. 58-78
Authors:
Cook, D
Hicks, G
Faber, V
Marathe, MV
Srinivasan, A
Sussmann, YJ
Thornquist, H
Citation: D. Cook et al., Combinatorial problems arising in deregulated electrical power industry: Survey and future directions, NONC OPTIM, 42, 2000, pp. 138-162
Authors:
Hunt, HB
Marathe, MV
Stearns, RE
Citation: Hb. Hunt et al., On the efficient approximability of "HARD" problems: A survey, NONC OPTIM, 42, 2000, pp. 308-322
Authors:
Krumke, SO
Noltemeier, H
Wirth, HC
Marathe, MV
Ravi, R
Ravi, SS
Sundaram, R
Citation: So. Krumke et al., Improving spanning trees by upgrading nodes, THEOR COMP, 221(1-2), 1999, pp. 139-155
Authors:
Krumke, SO
Marathe, MV
Noltemeier, H
Ravi, R
Ravi, SS
Sundarum, R
Wirth, HC
Citation: So. Krumke et al., Improving minimum cost spanning trees by upgrading nodes, J ALGORITHM, 33(1), 1999, pp. 92-111
Authors:
Krumke, SO
Marathe, MV
Noltemeier, H
Ravi, R
Ravi, SS
Citation: So. Krumke et al., Approximation algorithms for certain network improvement problems, J COMB OPTI, 2(3), 1998, pp. 257-288
Risultati:
1-9
|