• DocumentCode
    2645002
  • Title

    A 3-approximation for the minimum tree spanning k vertices

  • Author

    Garg, Naveen

  • Author_Institution
    Max-Planck-Inst. fur Inf., Saarbrucken, Germany
  • fYear
    1996
  • fDate
    14-16 Oct 1996
  • Firstpage
    302
  • Lastpage
    309
  • Abstract
    In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices
  • Keywords
    algorithm theory; graph theory; trees (mathematics); 3-approximation; graph; k-vertices; minimum tour; minimum tree; spanning k vertices; Approximation algorithms; Cost function; Delay; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
  • Conference_Location
    Burlington, VT
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-7594-2
  • Type

    conf

  • DOI
    10.1109/SFCS.1996.548489
  • Filename
    548489
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2645002