English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  A 3-approximation for the minimum tree spanning with k-vertices

Garg, N. (1996). A 3-approximation for the minimum tree spanning with k-vertices. In Foundations of computer science (FOCS-96): 37th annual symposium (pp. 302-309). Los Alamitos, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB29-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB2A-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Garg, Naveen1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021996
 Publication Status: Issued
 Pages: -
 Publishing info: Los Alamitos, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517759
Other: Local-ID: C1256428004B93B8-5D32770719E1158FC125646700426DD0-GSV
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Burlington, USA
Start-/End Date: 1996-10-14 - 1996-10-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: Foundations of computer science (FOCS-96) : 37th annual symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 302 - 309 Identifier: -