Sciweavers

    NETWORKS
    2008
    146views Computer Networks» more  NETWORKS 2008»
    Lower bounds for two-period grooming via linear programming duality
    13 years 11 months ago
    Lower bounds for two-period grooming via linear programming duality
    Download  www.dmi.unict.it
    In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
    Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
    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.