Sciweavers

    5595 search results - page 5 / 1119
    » Approximation Algorithms for Clustering Problems
    Sort
    View
    CLUSTER
    2006
    IEEE
    154views Distributed And Parallel Com...» more  CLUSTER 2006»
    A 2-Approximation Algorithm for Scheduling Independent Tasks onto a Uniform Parallel Machine and its Extension to a Computationa
    14 years 2 months ago
    A 2-Approximation Algorithm for Scheduling Independent Tasks onto a Uniform Parallel Machine and its Extension to a Computationa
    Download  www-hagi.ist.osaka-u.ac.jp
    Noriyuki Fujimoto, Kenichi Hagihara
    claim paper
    Read More »
    STOC
    2009
    ACM
    172views Algorithms» more  STOC 2009»
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    14 years 9 months ago
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    Download  www.cs.brown.edu
    We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
    Marek Karpinski, Warren Schudy
    claim paper
    Read More »
    PODS
    2008
    ACM
    153views Database» more  PODS 2008»
    Approximation algorithms for co-clustering
    14 years 8 months ago
    Approximation algorithms for co-clustering
    Download  www.cs.brown.edu
    Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
    Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
    claim paper
    Read More »
    IPL
    1998
    119views more  IPL 1998»
    A 2.5-Factor Approximation Algorithm for the k-MST Problem
    13 years 8 months ago
    A 2.5-Factor Approximation Algorithm for the k-MST Problem
    Download  www.cs.ust.hk
    The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
    Sunil Arya, H. Ramesh
    claim paper
    Read More »
    SODA
    2001
    ACM
    150views Algorithms» more  SODA 2001»
    A faster implementation of the Goemans-Williamson clustering algorithm
    13 years 10 months ago
    A faster implementation of the Goemans-Williamson clustering algorithm
    Download  www.hariharan-ramesh.com
    We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
    Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
    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.