Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13194
Title: A 2+epsilon approximation algorithm for the k-MST problem
Institution and School/Department of submitter: Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών
Keywords: k-minimum spanning tree,approximation algorithm,primal-dual schema,trees
URI: https://olympias.lib.uoi.gr/jspui/handle/123456789/13194
ISSN: 0025-5610
Link: <Go to ISI>://000236418400008
http://download.springer.com/static/pdf/845/art%253A10.1007%252Fs10107-005-0693-1.pdf?auth66=1390991909_7814733229273a02cc2fd8c0bbcafb6d&ext=.pdf
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Arora-2006-A 2+epsilon approxim.pdf177.05 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons