Sciweavers

    1040 search results - page 13 / 208
    » Rounding algorithms for covering problems
    Sort
    View
    IPL
    2008
    135views more  IPL 2008»
    On the Positive-Negative Partial Set Cover problem
    13 years 7 months ago
    On the Positive-Negative Partial Set Cover problem
    Download  www.cs.helsinki.fi
    The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
    Pauli Miettinen
    claim paper
    Read More »
    COR
    2007
    90views more  COR 2007»
    Analysis of bounds for a capacitated single-item lot-sizing problem
    13 years 7 months ago
    Analysis of bounds for a capacitated single-item lot-sizing problem
    Download  www2.isye.gatech.edu
    Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
    Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
    claim paper
    Read More »
    MOBIHOC
    2009
    ACM
    208views Computer Networks» more  MOBIHOC 2009»
    Optimal monitoring in multi-channel multi-radio wireless mesh networks
    14 years 8 months ago
    Optimal monitoring in multi-channel multi-radio wireless mesh networks
    Download  cobweb.ecn.purdue.edu
    Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
    Dong-Hoon Shin, Saurabh Bagchi
    claim paper
    Read More »
    STOC
    2009
    ACM
    160views Algorithms» more  STOC 2009»
    CSP gaps and reductions in the lasserre hierarchy
    14 years 8 months ago
    CSP gaps and reductions in the lasserre hierarchy
    Download  eccc.hpi-web.de
    We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
    Madhur Tulsiani
    claim paper
    Read More »
    SODA
    2000
    ACM
    78views Algorithms» more  SODA 2000»
    Strengthening integrality gaps for capacitated network design and covering problems
    13 years 8 months ago
    Strengthening integrality gaps for capacitated network design and covering problems
    Download  www.aladdin.cs.cmu.edu
    Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy...
    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.