Sciweavers

    SODA
    1998
    ACM
    157views Algorithms» more  SODA 1998»
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    13 years 5 months ago
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    Download  www.csie.ntu.edu.tw
    Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
    Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
    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.