article

On approximating the maximum diameter ratio of graphs

Authors:

Joze Marincek,

Bojan MoharAuthors Info & Claims

Discrete Mathematics, Volume 244, Issue 1-3

Pages 323 - 330

https://doi.org/10.1016/S0012-365X(01)00091-7

Published: 06 February 2002 Publication History

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.

References

[1]

{1} P. Alimonti, V. Kann, Hardness of approximating problems on cubic graphs, Proceedings of the Third Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 1203, Springer, Berlin, 1997, pp. 288-298.

Crossref

Google Scholar

[2]

{2} P. Berman, T. Fujito, On approximation properties of the independent set problem for degree 3 graphs, Proceedigs of the Third Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 955, Springer, Berlin, 1995, pp. 449-460.

Crossref

Google Scholar

[3]

{3} P.Z. Chinn, J. Chvátalová, A.K. Dewdney, N.E. Gibbs, The bandwidth problem for graphs and matrices-- a survey, J. Graph Theory 6 (1982) 223-254.

Crossref

Google Scholar

[4]

{4} F.R.K. Chung, Labelings of graphs, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory 3, Academic Press, New York, 1988, pp. 151-168.

Google Scholar

[5]

{5} P. Erdös, R.J. Faudree, C.C. Rousseau, R.H. Schelp, A local density condition for triangles, Discrete Math. 127 (1994) 153-161.

Digital Library

Google Scholar

[6]

{6} U. Feige, Approximating the bandwidth via volume respecting embeddings, 30th Annual ACM Symposium on Theory of Computing (Dallas, TX, 1998), J. Comput. System Sci. 60 (2000) 510-539.

Crossref

Google Scholar

[7]

{7} J. Håstad, Clique is hard to approximate within n1-ε, Proceedings of the 37th Annual IEEE Symposium FOCS, Burlington, VT, 1996, pp. 627-636.

Crossref

Google Scholar

[8]

{8} J. Håstad, Clique is hard to approximate within n1-ε, Acta Math. 182 (1999) 105-142.

Crossref

Google Scholar

[9]

{9} V. Kann, A. Panconesi, Hardness of approximation, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997, pp. 13-30.

Google Scholar

Cited By

View all

Asahiro YDoi YMiyano ESamizo KShimizu H(2018)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsAlgorithmica10.1007/s00453-017-0344-y80:6(1834-1856)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00453-017-0344-y
Asahiro YDoi YMiyano EShimizu H(2015)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsProceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 948610.1007/978-3-319-26626-8_43(586-600)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1007/978-3-319-26626-8_43
Asahiro YMiyano ESamizo K(2010)Approximating maximum diameter-bounded subgraphsProceedings of the 9th Latin American conference on Theoretical Informatics10.1007/978-3-642-12200-2_53(615-626)Online publication date: 19-Apr-2010
https://dl.acm.org/doi/10.1007/978-3-642-12200-2_53

Index Terms

On approximating the maximum diameter ratio of graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

The Complexity of Approximating the Oriented Diameter of Chordal Graphs
WG '02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

The oriented diameter of a (undirected) graph G is the smallest diameter among all the diameters of strongly connected orientations of G . We study algorithmic aspects of determining the oriented diameter of a chordal graph. We - give a linear time ...
Total domination in planar graphs of diameter two

MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
On 4-γt -critical graphs of diameter two

A vertex subset S of graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. For a graph G with no isolated vertex, the total domination number of G, denoted by @c"t(G), is the minimum cardinality of a total dominating ...

Comments

Information & Contributors

Information

Published In

Discrete Mathematics Volume 244, Issue 1-3

Algebraic and topological methods in graph theory

6 February 2002

543 pages

ISSN:0012-365X

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 06 February 2002

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Asahiro YDoi YMiyano ESamizo KShimizu H(2018)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsAlgorithmica10.1007/s00453-017-0344-y80:6(1834-1856)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00453-017-0344-y
Asahiro YDoi YMiyano EShimizu H(2015)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsProceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 948610.1007/978-3-319-26626-8_43(586-600)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1007/978-3-319-26626-8_43
Asahiro YMiyano ESamizo K(2010)Approximating maximum diameter-bounded subgraphsProceedings of the 9th Latin American conference on Theoretical Informatics10.1007/978-3-642-12200-2_53(615-626)Online publication date: 19-Apr-2010
https://dl.acm.org/doi/10.1007/978-3-642-12200-2_53

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

The Complexity of Approximating the Oriented Diameter of Chordal Graphs

Total domination in planar graphs of diameter two

On 4-γt -critical graphs of diameter two

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations