Sciweavers

    93 search results - page 4 / 19
    » Online Primal-Dual Algorithms for Covering and Packing Probl...
    Sort
    View
    ESA
    2004
    Springer
    151views Algorithms» more  ESA 2004»
    On Variable-Sized Multidimensional Packing
    15 years 10 months ago
    On Variable-Sized Multidimensional Packing
    Download  algo2.iti.kit.edu
    The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
    Leah Epstein, Rob van Stee
    claim paper
    Read More »
    159
    Voted
    JAIR
    2007
    141views more  JAIR 2007»
    Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
    15 years 6 months ago
    Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
    Download  www.aaai.org
    Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
    Alex S. Fukunaga, Richard E. Korf
    claim paper
    Read More »
    259
    Voted
    ESCAPE
    2007
    Springer
    350views Algorithms» more  ESCAPE 2007»
    An Approximation Algorithm for the General Mixed Packing and Covering Problem
    16 years 18 days ago
    An Approximation Algorithm for the General Mixed Packing and Covering Problem
    Download  www.informatik.uni-kiel.de
    Florian Diedrich, Klaus Jansen
    claim paper
    Read More »
    WAOA
    2004
    Springer
    146views Algorithms» more  WAOA 2004»
    Approximation Algorithms for Mixed Fractional Packing and Covering Problems
    15 years 11 months ago
    Approximation Algorithms for Mixed Fractional Packing and Covering Problems
    Download  www.ceid.upatras.gr
    Klaus Jansen
    claim paper
    Read More »
    FOCS
    1991
    IEEE
    114views Theoretical Computer Science» more  FOCS 1991»
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    15 years 10 months ago
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    Download  infolab.stanford.edu
    Serge A. Plotkin, David B. Shmoys, Éva Tard...
    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.