Sciweavers

    219 search results - page 30 / 44
    » A Better Approximation Ratio for the Vertex Cover Problem
    Sort
    View
    FCT
    2007
    Springer
    151views Applied Computing» more  FCT 2007»
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    13 years 11 months ago
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    Download  ccc.cs.uni-duesseldorf.de
    We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
    Gábor Erdélyi, Lane A. Hemaspaandra,...
    claim paper
    Read More »
    ISAAC
    2010
    Springer
    226views Algorithms» more  ISAAC 2010»
    On Tractable Cases of Target Set Selection
    13 years 5 months ago
    On Tractable Cases of Target Set Selection
    Download  theinf1.informatik.uni-jena.de
    We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
    André Nichterlein, Rolf Niedermeier, Johann...
    claim paper
    Read More »
    COMPGEOM
    2009
    ACM
    111views Discrete Geometry» more  COMPGEOM 2009»
    Epsilon nets and union complexity
    14 years 2 months ago
    Epsilon nets and union complexity
    Download  kam.mff.cuni.cz
    We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
    Kasturi R. Varadarajan
    claim paper
    Read More »
    JCO
    2006
    153views more  JCO 2006»
    Efficient point coverage in wireless sensor networks
    13 years 7 months ago
    Efficient point coverage in wireless sensor networks
    Download  www.cs.uml.edu
    We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
    Jie Wang, Ning Zhong
    claim paper
    Read More »
    SAC
    2003
    ACM
    117views Applied Computing» more  SAC 2003»
    Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
    14 years 23 days ago
    Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
    Download  www.ads.tuwien.ac.at
    Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
    Günther R. Raidl, Bryant A. Julstrom
    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.