Sciweavers

    7930 search results - page 8 / 1586
    » Greedy in Approximation Algorithms
    Sort
    View
    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 18 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 »
    ISAAC
    2000
    Springer
    178views Algorithms» more  ISAAC 2000»
    Simple Algorithms for a Weighted Interval Selection Problem
    13 years 11 months ago
    Simple Algorithms for a Weighted Interval Selection Problem
    Download  www.cs.umd.edu
    Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
    Thomas Erlebach, Frits C. R. Spieksma
    claim paper
    Read More »
    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 »
    JCO
    2010
    169views more  JCO 2010»
    An almost four-approximation algorithm for maximum weight triangulation
    13 years 5 months ago
    An almost four-approximation algorithm for maximum weight triangulation
    Download  www.ece.mtu.edu
    We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
    Shiyan Hu
    claim paper
    Read More »
    SIAMCOMP
    1998
    137views more  SIAMCOMP 1998»
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
    13 years 7 months ago
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
    Download  www.cc.gatech.edu
    We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
    Sridhar Rajagopalan, Vijay V. Vazirani
    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.