Author of the publication

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology.

, and . Algorithmica, 41 (1): 53-72 (2004)

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.

 

Other publications of authors with the same name

Linear time algorithms for computing the most reliable source on an unreliable tree network.. Networks, 30 (1): 37-45 (1997)A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology., and . Algorithmica, 41 (1): 53-72 (2004)A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria., , and . JCIS, page 319-323. JCIS / Association for Intelligent Machinery, Inc., (2002)K-pair delay constrained minimum cost routing in undirected networks., and . SODA, page 230-231. ACM/SIAM, (2001)MIMO-Pipe Modeling and Scheduling for Efficient Interference Management in Multihop MIMO Networks., , and . IEEE Trans. Vehicular Technology, 59 (8): 3966-3978 (2010)Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane., and . ISCAS (6), page 117-120. IEEE, (1999)Source-waiting QoS routing in networks with advanced resource reservations., , , and . ICC, page 619-624. IEEE, (2001)Efficient Anonymous Message Submission., , , and . IEEE Trans. Dependable Secur. Comput., 15 (2): 217-230 (2018)Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem., and . INFORMS J. Comput., 3 (3): 207-212 (1991)Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers., , , and . INFOCOM, page 1-9. IEEE, (2017)