Sciweavers

    85 search results - page 2 / 17
    » On Minimum Circular Arrangement
    Sort
    View
    SIAMCOMP
    2011
    234views Software Engineering» more  SIAMCOMP 2011»
    Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
    12 years 8 months ago
    Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
    Download  algo.epfl.ch
    We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
    Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
    claim paper
    Read More »
    IPL
    2007
    70views more  IPL 2007»
    An improved approximation ratio for the minimum linear arrangement problem
    13 years 5 months ago
    An improved approximation ratio for the minimum linear arrangement problem
    Download  www.cs.washington.edu
    We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
    Uriel Feige, James R. Lee
    claim paper
    Read More »
    DCG
    2006
    96views more  DCG 2006»
    k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
    13 years 5 months ago
    k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
    Download  www.ifisica.uaslp.mx
    We use circular sequences to give an improved lower bound on the minimum number of ( k)
    József Balogh, Gelasio Salazar
    claim paper
    Read More »
    CORR
    2006
    Springer
    144views Education» more  CORR 2006»
    The minimum linear arrangement problem on proper interval graphs
    13 years 5 months ago
    The minimum linear arrangement problem on proper interval graphs
    Download  www.wisdom.weizmann.ac.il
    We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
    Ilya Safro
    claim paper
    Read More »
    JAL
    2006
    67views more  JAL 2006»
    Graph minimum linear arrangement by multilevel weighted edge contractions
    13 years 5 months ago
    Graph minimum linear arrangement by multilevel weighted edge contractions
    Download  www.mcs.anl.gov
    Ilya Safro, Dorit Ron, Achi Brandt
    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.