Sciweavers

    120 search results - page 8 / 24
    » siamcomp 2008
    Sort
    View
    SIAMCOMP
    2008
    77views more  SIAMCOMP 2008»
    A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
    14 years 9 months ago
    A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
    Download  www.cs.brown.edu
    We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
    Philip N. Klein
    claim paper
    Read More »
    SIAMCOMP
    2008
    123views more  SIAMCOMP 2008»
    Approximation Algorithms for Biclustering Problems
    14 years 9 months ago
    Approximation Algorithms for Biclustering Problems
    Download  www.cs.cityu.edu.hk
    One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
    Lusheng Wang, Yu Lin, Xiaowen Liu
    claim paper
    Read More »
    SIAMCOMP
    2008
    75views more  SIAMCOMP 2008»
    Splitting NP-Complete Sets
    14 years 9 months ago
    Splitting NP-Complete Sets
    Download  www.cs.iastate.edu
    We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result a...
    Christian Glaßer, Aduri Pavan, Alan L. Selma...
    claim paper
    Read More »
    SIAMCOMP
    2008
    101views more  SIAMCOMP 2008»
    Combination Can Be Hard: Approximability of the Unique Coverage Problem
    14 years 9 months ago
    Combination Can Be Hard: Approximability of the Unique Coverage Problem
    Download  www-math.mit.edu
    We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
    Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
    claim paper
    Read More »
    SIAMCOMP
    2000
    86views more  SIAMCOMP 2000»
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
    14 years 9 months ago
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
    Download  www.lsi.upc.edu
    An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
    Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
    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.