Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Given a graph G with m edges and n nodes, a spanning tree T of G, and an edge e that is being deleted from or inserted into G, we give efficient O (n) algorithms to compute a possible swap for e that minimizes the diameter of the new spanning tree. This problem arises in high-speed networks, particularly in optical networks. © 1998 Springer-Verlag New York Inc.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996