【持续性肾脏替代治疗CRRT英文精品课件】Augmenting Paths, Witnesses and Improved Approximations for Bounded Degree MSTs.pptVIP

Augmenting Paths, Witnesses and Improved Approximations for Bounded Degree MSTs K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar UC Berkeley BDMST : The Problem Given: Graph: G Edge costs: ce Degree bound : D Find a minimum cost tree that respects the degree bounds BDMST : The Problem Generalization of Minimum Cost Hamiltonian Path For general weighted graphs, No Polynomial-Factor Approximation unless P=NP Our Work: Relax degree bounds to obtain an approximation in cost Previous Results [FR94] Unweighted graphs Additive 1 approximation to degree [KR00] Weighted graphs, uniform degree boun