Sciweavers

    35 search results - page 1 / 7
    » Improved LP Lower Bounds for Difference Triangle Sets
    Sort
    View
    COMBINATORICS
    1999
    77views more  COMBINATORICS 1999»
    Improved LP Lower Bounds for Difference Triangle Sets
    13 years 5 months ago
    Improved LP Lower Bounds for Difference Triangle Sets
    Download  www.combinatorics.org
    James B. Shearer
    claim paper
    Read More »
    STACS
    2009
    Springer
    124views Theoretical Computer Science» more  STACS 2009»
    A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
    14 years 6 days ago
    A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
    Download  hal.archives-ouvertes.fr
    We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
    Kenya Ueno
    claim paper
    Read More »
    FOCS
    2008
    IEEE
    132views Theoretical Computer Science» more  FOCS 2008»
    On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
    13 years 6 months ago
    On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
    Download  www.deeparnab.org
    In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
    Deeparnab Chakrabarty, Gagan Goel
    claim paper
    Read More »
    COMPGEOM
    2010
    ACM
    147views Discrete Geometry» more  COMPGEOM 2010»
    On the complexity of sets of free lines and line segments among balls in three dimensions
    13 years 10 months ago
    On the complexity of sets of free lines and line segments among balls in three dimensions
    Download  www.loria.fr
    We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
    Marc Glisse, Sylvain Lazard
    claim paper
    Read More »
    DM
    2008
    104views more  DM 2008»
    Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
    13 years 5 months ago
    Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
    Download  www.dur.ac.uk
    We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
    Florent R. Madelaine, Iain A. Stewart
    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.