Sciweavers

    4377 search results - page 32 / 876
    » Mass problems and randomness
    Sort
    View
    RSA
    2006
    74views more  RSA 2006»
    A randomized on-line algorithm for the k-server problem on a line
    14 years 9 months ago
    A randomized on-line algorithm for the k-server problem on a line
    Download  www.math.u-szeged.hu
    The k
    Béla Csaba, Sachin Lodha
    claim paper
    Read More »
    WEA
    2004
    Springer
    85views Algorithms» more  WEA 2004»
    Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
    15 years 3 months ago
    Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
    Download  www.cos.ufrj.br
    A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
    Celina M. Herrera de Figueiredo, Guilherme Dias da...
    claim paper
    Read More »
    SODA
    2010
    ACM
    234views Algorithms» more  SODA 2010»
    PTAS for maximum weight independent set problem with random weights in bounded degree graphs
    15 years 7 months ago
    PTAS for maximum weight independent set problem with random weights in bounded degree graphs
    Download  siam.org
    Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
    David Gamarnik, David Goldberg, Theophane Weber
    claim paper
    Read More »
    IFIP
    2007
    Springer
    103views Programming Languages» more  IFIP 2007»
    Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
    15 years 3 months ago
    Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
    Download  ifip2007.agh.edu.pl
    Jacek Czekaj, Leslaw Socha
    claim paper
    Read More »
    WADS
    2005
    Springer
    88views Algorithms» more  WADS 2005»
    Approximating the Online Set Multicover Problems via Randomized Winnowing
    15 years 3 months ago
    Approximating the Online Set Multicover Problems via Randomized Winnowing
    Download  www.cs.uic.edu
    Piotr Berman, Bhaskar DasGupta
    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-2025, USA.