Sciweavers

    SODA
    1997
    ACM
    114views Algorithms» more  SODA 1997»
    Better Approximation Guarantees for Job-shop Scheduling
    13 years 5 months ago
    Better Approximation Guarantees for Job-shop Scheduling
    Download  www.cs.hmc.edu
    Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
    Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv...
    claim paper
    Read More »
    STACS
    2009
    Springer
    152views Theoretical Computer Science» more  STACS 2009»
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
    13 years 11 months ago
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
    Download  drops.dagstuhl.de
    We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
    Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
    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.