Sciweavers

    IPCO
    2001
    166views Optimization» more  IPCO 2001»
    Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
    14 years 5 months ago
    Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
    Download  theory.stanford.edu
    Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
    Fabián A. Chudak, Tim Roughgarden, David P....
    claim paper
    Read More »
    STOC
    2004
    ACM
    107views Algorithms» more  STOC 2004»
    Primal-dual algorithms for deterministic inventory problems
    15 years 4 months ago
    Primal-dual algorithms for deterministic inventory problems
    Download  legacy.orie.cornell.edu
    We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
    Retsef Levi, Robin Roundy, David B. Shmoys
    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-2025, USA.