Sciweavers

    20 search results - page 3 / 4
    » ipco 2008
    Sort
    View
    IPCO
    2008
    129views Optimization» more  IPCO 2008»
    A Polynomial Time Approximation Scheme for the Square Packing Problem
    13 years 6 months ago
    A Polynomial Time Approximation Scheme for the Square Packing Problem
    Download  www.informatik.uni-kiel.de
    Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
    Klaus Jansen, Roberto Solis-Oba
    claim paper
    Read More »
    IPCO
    2010
    184views Optimization» more  IPCO 2010»
    Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
    13 years 6 months ago
    Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
    Download  www-or.amp.i.kyoto-u.ac.jp
    Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
    Takuro Fukunaga
    claim paper
    Read More »
    IPCO
    2008
    114views Optimization» more  IPCO 2008»
    The Stochastic Machine Replenishment Problem
    13 years 6 months ago
    The Stochastic Machine Replenishment Problem
    Download  www.cs.duke.edu
    We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
    Kamesh Munagala, Peng Shi
    claim paper
    Read More »
    IPCO
    2008
    87views Optimization» more  IPCO 2008»
    Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
    13 years 6 months ago
    Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
    Download  www.cs.toronto.edu
    We consider the standard semidefinite programming (SDP) relaxation for vertex cover to which all hypermetric inequalities supported on at most k vertices have been added. We show t...
    Konstantinos Georgiou, Avner Magen, Iannis Tourlak...
    claim paper
    Read More »
    IPCO
    2008
    91views Optimization» more  IPCO 2008»
    New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
    13 years 6 months ago
    New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
    Download  www.cc.gatech.edu
    Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
    Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
    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.