Open AccessOn the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs
Author(s) -
ShihChia Chang,
Li-Hsuan Chen,
SunYuan Hsieh,
Ling-Ju Hung,
Shih-Shun Kao,
Ralf Klasing
Publication year - 2022
Publication title -
ssrn electronic journal
Language(s) - English
Resource type - Journals
ISSN - 1556-5068
DOI - 10.2139/ssrn.4196893
Subject(s) - parameterized complexity , metric (unit) , combinatorics , hardness of approximation , mathematics , induced subgraph isomorphism problem , discrete mathematics , approximation algorithm , graph , economics , operations management , voltage graph , line graph
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom