Sciweavers

    7015 search results - page 116 / 1403
    » Approximation algorithms for co-clustering
    Sort
    View
    FSTTCS
    2000
    Springer
    98views Software Engineering» more  FSTTCS 2000»
    Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
    15 years 10 months ago
    Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
    Download  www.dis.uniroma1.it
    Stefano Leonardi, Alberto Marchetti-Spaccamela, An...
    claim paper
    Read More »
    185
    Voted
    FOCS
    1991
    IEEE
    114views Theoretical Computer Science» more  FOCS 1991»
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    15 years 10 months ago
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    Download  infolab.stanford.edu
    Serge A. Plotkin, David B. Shmoys, Éva Tard...
    claim paper
    Read More »
    BIRTHDAY
    2010
    Springer
    159views Applied Computing» more  BIRTHDAY 2010»
    A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
    15 years 8 months ago
    A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
    Download  www.dcs.kcl.ac.uk
    Maxime Crochemore, Costas S. Iliopoulos, Solon P. ...
    claim paper
    Read More »
    COCOA
    2007
    Springer
    128views Discrete Geometry» more  COCOA 2007»
    Improved Approximation Algorithm for Connected Facility Location Problems
    15 years 8 months ago
    Improved Approximation Algorithm for Connected Facility Location Problems
    Download  tclab.kaist.ac.kr
    Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
    claim paper
    Read More »
    140
    Voted
    COCOA
    2008
    Springer
    117views Discrete Geometry» more  COCOA 2008»
    Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
    15 years 8 months ago
    Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
    Download  tclab.kaist.ac.kr
    In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
    Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.