( en | de | ru )

 

Disambiguation of "Ravi, S. S."

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for Path-Based Placement of Inspection Stations on Networks.

, , and . INFORMS J. Comput., 12 (2): 136-149 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S Hüttelmaier

S Leopold

S Steinlechner

S Bachmann

S Ulrich

 

Other publications of authors with the same name

The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits., , , and . IEEE Trans. Computers, 38 (6): 865-869 (1989)Improved Bounds for Algorithm-Based Fault Tolerance., and . IEEE Trans. Computers, 42 (5): 630-635 (1993)Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors., , and . Algorithmica, 12 (6): 421-435 (1994)On Multi-Label Linear Interval Routing Schemes., , and . Comput. J., 39 (2): 133-139 (1996)Facility Dispersion Problems Under Capacity and Cost Constraints., , and . J. Comb. Optim., 4 (1): 7-33 (2000)The complexity of approximating PSPACE-Complete problems for hierarchical specifications., , and . CoRR, (1994)Intractability and clustering with constraints., and . ICML, volume 227 of ACM International Conference Proceeding Series, page 201-208. ACM, (2007)A mobility and traffic generation framework for modeling and simulating ad hoc communication networks., , , and . SAC, page 122-126. ACM, (2002)Upgrading Bottleneck Constrained Forests., , , , and . WG, volume 1517 of Lecture Notes in Computer Science, page 215-226. Springer, (1998)Modifying Networks to Obtain Low Cost Trees., , , , and . WG, volume 1197 of Lecture Notes in Computer Science, page 293-307. Springer, (1996)