Sciweavers

    536 search results - page 7 / 108
    » The hardness and approximation algorithms for l-diversity
    Sort
    View
    CIAC
    2010
    Springer
    282views Algorithms» more  CIAC 2010»
    Improved Approximations for TSP with Simple Precedence Constraints
    13 years 11 months ago
    Improved Approximations for TSP with Simple Precedence Constraints
    Download  people.ksp.sk
    In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
    Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
    claim paper
    Read More »
    CIAC
    2006
    Springer
    106views Algorithms» more  CIAC 2006»
    On the Hardness of Range Assignment Problems
    13 years 11 months ago
    On the Hardness of Range Assignment Problems
    Download  www.zpr.uni-koeln.de
    We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
    Bernhard Fuchs
    claim paper
    Read More »
    ECCC
    2007
    185views more  ECCC 2007»
    Trapdoors for Hard Lattices and New Cryptographic Constructions
    13 years 7 months ago
    Trapdoors for Hard Lattices and New Cryptographic Constructions
    Download  people.csail.mit.edu
    We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
    Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
    claim paper
    Read More »
    TAMC
    2010
    Springer
    216views Applied Computing» more  TAMC 2010»
    Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
    13 years 6 months ago
    Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
    Download  www.ii.uib.no
    Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
    Pinar Heggernes, Daniel Meister, Udi Rotics
    claim paper
    Read More »
    ISAAC
    2007
    Springer
    95views Algorithms» more  ISAAC 2007»
    Hardness and Approximation of Traffic Grooming
    14 years 2 months ago
    Hardness and Approximation of Traffic Grooming
    Download  www.cs.technion.ac.il
    Omid Amini, Stéphane Pérennes, Ignas...
    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.