Sciweavers

    7015 search results - page 42 / 1403
    » Approximation algorithms for co-clustering
    Sort
    View
    STOC
    2005
    ACM
    174views Algorithms» more  STOC 2005»
    On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    14 years 9 months ago
    On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    Download  www.math.cmu.edu
    In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
    Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
    claim paper
    Read More »
    NIPS
    2007
    138views Information Technology» more  NIPS 2007»
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    13 years 10 months ago
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    Download  books.nips.cc
    We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
    Kyomin Jung, Devavrat Shah
    claim paper
    Read More »
    SIAMCOMP
    2008
    124views more  SIAMCOMP 2008»
    A Faster, Better Approximation Algorithm for the Minimum Latency Problem
    13 years 9 months ago
    A Faster, Better Approximation Algorithm for the Minimum Latency Problem
    Download  pluto.huji.ac.il
    We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
    Aaron Archer, Asaf Levin, David P. Williamson
    claim paper
    Read More »
    FOCS
    2005
    IEEE
    108views Theoretical Computer Science» more  FOCS 2005»
    An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
    14 years 2 months ago
    An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
    Download  www.cs.cornell.edu
    In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
    Jon M. Kleinberg
    claim paper
    Read More »
    STOC
    2010
    ACM
    186views Algorithms» more  STOC 2010»
    Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
    14 years 1 months ago
    Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
    Download  people.csail.mit.edu
    We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
    Aleksander Madry
    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.