Title of article :
On approximating the maximum diameter ratio of graphs Original Research Article
Author/Authors :
Jo?e Marin?ek، نويسنده , , Bojan Mohar، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
It is proved that computing the maximum diameter ratio (also known as the local density) of a graph is APX-complete. The related problem of finding a maximum subgraph of a fixed diameter d⩾1 is proved to be even harder to approximate.
Keywords :
Approximation algorithm , APX-complete problem , Diameter , Local density
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
