Sciweavers

    ESA
    1995
    Springer
    126views Algorithms» more  ESA 1995»

    The Online Transportation Problem

    14 years 4 months ago
    The Online Transportation Problem
    Download  www.cs.pitt.edu
    We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra server per site. Using metric embedding results in the literature, one can then obtain a poly-log-competitive randomized online algorithm for the online transportation on an arbitrary metric space when the online algorithm has one extra server per site.
    Bala Kalyanasundaram, Kirk Pruhs
    claim paper
    Added 26 Aug 2010
    Updated 26 Aug 2010
    Type Conference
    Year 1995
    Where ESA
    Authors Bala Kalyanasundaram, Kirk Pruhs
    Comments (0)
    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.