Skip to main content
SpringerLink
Log in

On the asymptotic optimality of a solution of the euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight

  • Computer Science
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

In the problem of covering an n-vertex graph by m cycles of maximum total weight, it is required to find a family of m vertex-nonadjacent cycles such that it covers all vertices of the graph and the total weight of edges in the cover is maximum. The paper presents an algorithm for approximately solving the problem of covering a graph in Euclidean d-space R d by m nonadjacent cycles of maximum total weight. The algorithm has time complexity O(n 3). An estimate of the accuracy of the algorithm depending on the parameters d, m, and n is substantiated; it is shown that if the dimension d of the space is fixed and the number of covering cycles is m = o(n), then the algorithm is asymptotically exact.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Kh. Gimadi, in Proceedings of 12th Baikal International Conference “Optimization Methods and Their Applications,” Irkutsk, Russia, 2001 (Irkutsk, 2001), Vol. 1, pp. 117–124.

    Google Scholar 

  2. A. I. Serdyukov, in Control Systems (Inst. Mat., Novosibirsk, 1987), Vol. 27, pp. 79–87 [in Russian].

    Google Scholar 

  3. M. Yu. Khachai and E. D. Neznakhina, Tr. Inst. Mat. Mekh. 20 4, 297–311 (2014).

    Google Scholar 

  4. M. Yu. Khachai and E. D. Neznakhina, Dokl. Math. 91 2, 240–245 (2015).

    Article  MathSciNet  Google Scholar 

  5. H. N. Gabow, in Proceedings 15th Annual ACM Symposium on Theory of Computing, Boston, USA, 1983 (ACM, New York, 1983), pp. 448–456.

    Google Scholar 

  6. B. Manthey, Discrete Appl. Math. 157 7, 1470–1480 (2009).

    Article  MathSciNet  Google Scholar 

  7. The Traveling Salesman Problem and Its Variations, Ed. by G. Gutin and A. Punnen (Kluwer Academic, Dortrecht, 2002).

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090, Russia

    E. Kh. Gimadi & I. A. Rykov

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    E. Kh. Gimadi

Authors
  1. E. Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. A. Rykov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Kh. Gimadi.

Additional information

Original Russian Text © E.Kh. Gimadi, I.A. Rykov, 2016, published in Doklady Akademii Nauk, 2016, Vol. 466, No. 5, pp. 529–532.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gimadi, E.K., Rykov, I.A. On the asymptotic optimality of a solution of the euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight. Dokl. Math. 93, 117–120 (2016). https://doi.org/10.1134/S1064562416010233

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562416010233

Keywords

Search

Navigation