Improving minimum cost spanning trees by upgrading nodes

Authors:
S. O. Krumke;M. V. Marathe;H. Noltemeier;R. Ravi;S. S. Ravi;R. Sundaram;H.- C. Wirth
Affiliations:
-;-;-;-;-;-;-
Venue:
Journal of Algorithms
Year:
1999

The minimum generalized vertex cover problem

ACM Transactions on Algorithms (TALG)
Upgrading shortest paths in networks

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Further research on node based bottleneck improvement problem for multicut

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph

Discrete Optimization

Hi-index	0.02