Sciweavers

    841 search results - page 10 / 169
    » Approximability of Minimum AND-Circuits
    Sort
    View
    DC
    2008
    97views Internet Technology» more  DC 2008»
    A fast distributed approximation algorithm for minimum spanning trees
    13 years 7 months ago
    A fast distributed approximation algorithm for minimum spanning trees
    Download  staff.vbi.vt.edu
    Maleq Khan, Gopal Pandurangan
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    74views Applied Computing» more  COMGEO 2006»
    The minimum Manhattan network problem: Approximations and exact solutions
    13 years 7 months ago
    The minimum Manhattan network problem: Approximations and exact solutions
    Download  www1.informatik.uni-wuerzburg.de
    Marc Benkert, Alexander Wolff, Florian Widmann, Ta...
    claim paper
    Read More »
    JCO
    2006
    66views more  JCO 2006»
    Tree edge decomposition with an application to minimum ultrametric tree approximation
    13 years 7 months ago
    Tree edge decomposition with an application to minimum ultrametric tree approximation
    Download  par.cse.nsysu.edu.tw
    A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
    Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
    claim paper
    Read More »
    SIAMCOMP
    2008
    60views more  SIAMCOMP 2008»
    Improved Approximation Algorithms for Minimum Weight Vertex Separators
    13 years 7 months ago
    Improved Approximation Algorithms for Minimum Weight Vertex Separators
    Download  research.microsoft.com
    Uriel Feige, MohammadTaghi Hajiaghayi, James R. Le...
    claim paper
    Read More »
    IPL
    2007
    70views more  IPL 2007»
    An improved approximation ratio for the minimum linear arrangement problem
    13 years 7 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 »
    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.