Sciweavers

    9572 search results - page 27 / 1915
    » Cover Algorithms and Their Combination
    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 »
    COMBINATORICS
    2006
    147views more  COMBINATORICS 2006»
    A Survey on Packing and Covering Problems in the Hamming Permutation Space
    13 years 7 months ago
    A Survey on Packing and Covering Problems in the Hamming Permutation Space
    Download  www.combinatorics.org
    Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...
    Jörn Quistorff
    claim paper
    Read More »
    MSS
    2008
    IEEE
    118views Hardware» more  MSS 2008»
    Computing the minimal covering set
    13 years 7 months ago
    Computing the minimal covering set
    Download  www2.tcs.ifi.lmu.de
    We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
    Felix Brandt, Felix A. Fischer
    claim paper
    Read More »
    STOC
    1999
    ACM
    123views Algorithms» more  STOC 1999»
    Covering Rectilinear Polygons with Axis-Parallel Rectangles
    13 years 12 months ago
    Covering Rectilinear Polygons with Axis-Parallel Rectangles
    Download  eprints.iisc.ernet.in
    We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
    V. S. Anil Kumar, H. Ramesh
    claim paper
    Read More »
    STOC
    2005
    ACM
    89views Algorithms» more  STOC 2005»
    Universal approximations for TSP, Steiner tree, and set cover
    14 years 7 months ago
    Universal approximations for TSP, Steiner tree, and set cover
    Download  www.ccs.neu.edu
    Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...
    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.