Tight estimation of bichromatic farthest pair in graphs and related problems

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.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2019

Author dc:creator

• Dalirrooyfard, Mina.

Advisor dc:contributor.advisor

• Virginia Vassilevska Williams.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/121731

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/121731