Sciweavers

    166 search results - page 3 / 34
    » A fast distributed approximation algorithm for minimum spann...
    Sort
    View
    STOC
    2000
    ACM
    77views Algorithms» more  STOC 2000»
    A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
    13 years 11 months ago
    A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
    Download  www.math.uwaterloo.ca
    Jochen Könemann, R. Ravi
    claim paper
    Read More »
    STOC
    1994
    ACM
    97views Algorithms» more  STOC 1994»
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    13 years 10 months ago
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    Download  www.cs.uwaterloo.ca
    Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
    Naveen Garg, Dorit S. Hochbaum
    claim paper
    Read More »
    CN
    2008
    93views more  CN 2008»
    A fast algorithm for computing minimum routing cost spanning trees
    13 years 6 months ago
    A fast algorithm for computing minimum routing cost spanning trees
    Download  telecom.inescporto.pt
    Rui Campos, Manuel Ricardo
    claim paper
    Read More »
    SODA
    2003
    ACM
    94views Algorithms» more  SODA 2003»
    Sublinear-time approximation of Euclidean minimum spanning tree
    13 years 8 months ago
    Sublinear-time approximation of Euclidean minimum spanning tree
    Download  www.cs.princeton.edu
    Artur Czumaj, Funda Ergün, Lance Fortnow, Avn...
    claim paper
    Read More »
    FOCS
    1996
    IEEE
    111views Theoretical Computer Science» more  FOCS 1996»
    A 3-Approximation for the Minimum Tree Spanning k Vertices
    13 years 10 months ago
    A 3-Approximation for the Minimum Tree Spanning k Vertices
    Download  www.carlyerger.com
    In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
    Naveen Garg
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.