Ghosh, Arijit ;
Kolay, Sudeshna ;
Mishra, Gopinath
FPT Algorithms for Embedding into Low Complexity Graphic Metrics
Abstract
The Metric Embedding problem takes as input two metric spaces (X,D_X) and (Y,D_Y), and a positive integer d. The objective is to determine whether there is an embedding F:X  > Y such that the distortion d_{F} <= d. Such an embedding is called a distortion d embedding. In parameterized complexity, the Metric Embedding problem is known to be Whard and therefore, not expected to have an FPT algorithm. In this paper, we consider the GenGraph Metric Embedding problem, where the two metric spaces are graph metrics. We explore the extent of tractability of the problem in the parameterized complexity setting. We determine whether an unweighted graph metric (G,D_G) can be embedded, or bijectively embedded, into another unweighted graph metric (H,D_H), where the graph H has low structural complexity. For example, H is a cycle, or H has bounded treewidth or bounded connected treewidth. The parameters for the algorithms are chosen from the upper bound d on distortion, bound Delta on the maximum degree of H, treewidth alpha of H, and the connected treewidth alpha_{c} of H.
Our general approach to these problems can be summarized as trying to understand the behavior of the shortest paths in G under a low distortion embedding into H, and the structural relation the mapping of these paths has to shortest paths in H.
BibTeX  Entry
@InProceedings{ghosh_et_al:LIPIcs:2018:9498,
author = {Arijit Ghosh and Sudeshna Kolay and Gopinath Mishra},
title = {{FPT Algorithms for Embedding into Low Complexity Graphic Metrics}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {35:135:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770811},
ISSN = {18688969},
year = {2018},
volume = {112},
editor = {Yossi Azar and Hannah Bast and Grzegorz Herman},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9498},
URN = {urn:nbn:de:0030drops94988},
doi = {10.4230/LIPIcs.ESA.2018.35},
annote = {Keywords: Metric spaces, metric embedding, FPT, dynamic programming}
}
14.08.2018
Keywords: 

Metric spaces, metric embedding, FPT, dynamic programming 
Seminar: 

26th Annual European Symposium on Algorithms (ESA 2018)

Issue date: 

2018 
Date of publication: 

14.08.2018 