On approximating the maximum diameter ratio of graphs

Authors:
Joze Marincek;Bojan Mohar
Affiliations:
Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia;Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia
Venue:
Discrete Mathematics - Algebraic and topological methods in graph theory
Year:
2002

Citing 5
Cited 1

A local density condition for triangles

Discrete Mathematics - Special issue on graph theory and applications
Approximating the bandwidth via volume respecting embeddings

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Hardness of Approximating Problems on Cubic Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Approximating maximum diameter-bounded subgraphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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.