AAAAAA

   
Results: 1-13 |
Results: 13
Upgrading bottleneck constrained forests
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
Discovery of association rules in medical data
Authors: Doddi, S Marathe, A Ravi, SS Torney, DC
Citation: S. Doddi et al., Discovery of association rules in medical data, MED INF IN, 26(1), 2001, pp. 25-33
Models and approximation algorithms for channel assignment in radio networks
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
Approximation algorithms for degree-constrained minimum-cost network-design problems
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
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
Authors: Rosenkrantz, DJ Yu, L Ravi, SS
Citation: Dj. Rosenkrantz et al., Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times, ALGORITHMIC, 30(1), 2001, pp. 83-100
Facility dispersion problems under capacity and cost constraints
Authors: Rosenkrantz, DJ Tayi, GK Ravi, SS
Citation: Dj. Rosenkrantz et al., Facility dispersion problems under capacity and cost constraints, J COMB OPTI, 4(1), 2000, pp. 7-33
Algorithms for path-based placement of inspection stations on networks
Authors: Rosenkrantz, DJ Tayi, GK Ravi, SS
Citation: Dj. Rosenkrantz et al., Algorithms for path-based placement of inspection stations on networks, INFORMS J C, 12(2), 2000, pp. 136-149
Alarm placement in systems with fault propagation
Authors: Lakshmanan, KB Rosenkrantz, DJ Ravi, SS
Citation: Kb. Lakshmanan et al., Alarm placement in systems with fault propagation, THEOR COMP, 243(1-2), 2000, pp. 269-288
Using data flow information to obtain efficient check sets for algorithm-based fault tolerance
Authors: Narasimhan, R Rosenkrantz, DJ Ravi, SS
Citation: R. Narasimhan et al., Using data flow information to obtain efficient check sets for algorithm-based fault tolerance, INT J P PRO, 27(4), 1999, pp. 289-323
Improving spanning trees by upgrading nodes
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
Improving minimum cost spanning trees by upgrading nodes
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
Path problems in networks with vector-valued edge weights
Authors: Tayi, GK Rosenkrantz, DJ Ravi, SS
Citation: Gk. Tayi et al., Path problems in networks with vector-valued edge weights, NETWORKS, 34(1), 1999, pp. 19-35
Approximation algorithms for certain network improvement problems
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-13 |