Sciweavers

    1272 search results - page 6 / 255
    » The Set Cover with Pairs Problem
    Sort
    View
    SIAMDM
    2008
    77views more  SIAMDM 2008»
    Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
    14 years 11 months ago
    Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
    Download  pluto.huji.ac.il
    Asaf Levin
    claim paper
    Read More »
    MP
    2010
    79views more  MP 2010»
    MIP reformulations of the probabilistic set covering problem
    14 years 10 months ago
    MIP reformulations of the probabilistic set covering problem
    Download  edoc.hu-berlin.de
    Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
    claim paper
    Read More »
    CORR
    2008
    Springer
    151views Education» more  CORR 2008»
    Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
    14 years 11 months ago
    Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
    Download  drops.dagstuhl.de
    Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
    Sören Laue
    claim paper
    Read More »
    COMPGEOM
    2009
    ACM
    130views Discrete Geometry» more  COMPGEOM 2009»
    On the set multi-cover problem in geometric settings
    15 years 6 months ago
    On the set multi-cover problem in geometric settings
    Download  www.almaden.ibm.com
    We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
    Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
    claim paper
    Read More »
    IPL
    2006
    83views more  IPL 2006»
    The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
    14 years 11 months ago
    The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
    Download  www.cos.ufrj.br
    A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
    Claudson F. Bornstein, Celina M. Herrera de Figuei...
    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-2025, USA.