1 / 7

Approximating the two-source minimum routing cost spanning trees

Approximating the two-source minimum routing cost spanning trees. Bang Ye Wu Shu-Te University. Problem Definition. Input: an undirected graph with nonnegative edge lengths, two vertices as sources and all vertices as destinations

milica
Télécharger la présentation

Approximating the two-source minimum routing cost spanning trees

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Approximating the two-source minimum routing cost spanning trees Bang Ye Wu Shu-Te University

  2. Problem Definition • Input: an undirected graph with nonnegative edge lengths, two vertices as sources and all vertices as destinations • Output: a spanning tree such that the total distance from sources to destinations (including the sources) is minimum, that is, we want to minimize

  3. Result • The NP-hardness of the problem. • A PTAS: for any e>0, the scheme finds a (1+ e)-approximation solution with time complexity

  4. Related problems • OCT: SlijdT(i,j), arbitrary nonnegative requirements. • MRCT: requirement=1 • PROCT: lij=ri*rj, ri is nonnegative vertex weight • SROCT: lij=ri+rj • k-MRCT is a special case of SROCT. The sources have weight 1 and others have weight 0

  5. OCT problems

  6. Previous results

  7. Future research • k-MRCT, fixed k and arbitrary k • K-OCT, fixed k and arbitrary k • On the plane

More Related