Sciweavers

    113
    Voted
    STOC
    2002
    ACM
    121views Algorithms» more  STOC 2002»
    Average case analysis for batched disk scheduling and increasing subsequences
    16 years 3 months ago
    Average case analysis for batched disk scheduling and increasing subsequences
    Download  www.cs.bgu.ac.il
    We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
    Eitan Bachmat
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.