Sciweavers

    ISAAC
    1998
    Springer
    153views Algorithms» more  ISAAC 1998»
    Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
    14 years 3 months ago
    Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
    Download  www.csie.ntu.edu.tw
    Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
    Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    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.