2026-09-20T00:14:49Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1217312021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Virginia Vassilevska Williams.
Dalirrooyfard, Mina.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-07-17T20:58:50Z
2019-07-17T20:58:50Z
2019
2019
https://hdl.handle.net/1721.1/121731
1102049342
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 63-64).
Diameter and Radius are two of the most fundamental and well-studied graph parameters, where the diameter of a graph is the largest shortest paths distance and the radius is the smallest distance for which a "center" node can reach all other nodes. The natural and important ST-variant considers two subsets S and T of the vertex set and lets the ST-diameter be the maximum distance between a node in S and a node in T, and the ST-radius be the minimum distance for a node of S to reach all nodes of T. The bichromatic variant is the special case in which S and T partition the vertex set. This thesis provides a comprehensive study of the approximability of ST and Bichromatic Diameter, Radius, and Eccentricities in graphs with and without directions and weights. This Thesis is a joint work with Nikhil Vyas, Nicole Wein and Virginia Vassilevska Williams.
by Mina Dalirrooyfard.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
64 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Tight estimation of bichromatic farthest pair in graphs and related problems
Thesis
application/pdf
2019-07-17T20:58:47Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8d58f18c-da92-4f7c-bc39-2dd429585cee">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Tight estimation of bichromatic farthest pair in graphs and related problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Dalirrooyfard, Mina.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Diameter and Radius are two of the most fundamental and well-studied graph parameters, where the diameter of a graph is the largest shortest paths distance and the radius is the smallest distance for which a "center" node can reach all other nodes. The natural and important ST-variant considers two subsets S and T of the vertex set and lets the ST-diameter be the maximum distance between a node in S and a node in T, and the ST-radius be the minimum distance for a node of S to reach all nodes of T. The bichromatic variant is the special case in which S and T partition the vertex set. This thesis provides a comprehensive study of the approximability of ST and Bichromatic Diameter, Radius, and Eccentricities in graphs with and without directions and weights. This Thesis is a joint work with Nikhil Vyas, Nicole Wein and Virginia Vassilevska Williams.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>