Loading...
Please wait, while we are loading the content...
Similar Documents
Separator theorem and steiner trees
Content Provider | Indraprastha Institute of Information Technology, Delhi |
---|---|
Author | Jain, Kshitij Mahajan, Sahil |
Abstract | In this report, along with extending ideas presented in previous report we present a proof for finnding O(√n) cost 1 3 : 2 3 separator theorem for disjoint unit disk graph in R2. We also present ideas of planar separator theorem which would be highly useful in fi nding a PTAS for steiner trees in disk graphs. |
File Format | |
Language | English |
Access Restriction | Authorized |
Subject Keyword | UDG Disk Graph Line Separator Steiner PTAS Approximation TSP Separator |
Content Type | Text |
Educational Degree | Bachelor of Technology (B.Tech.) |
Subject | Data processing & computer science |