Sciweavers

    20 search results - page 1 / 4
    » Approximate Graph Coloring by Semidefinite Programming
    Sort
    View
    FOCS
    1994
    IEEE
    132views Theoretical Computer Science» more  FOCS 1994»
    Approximate Graph Coloring by Semidefinite Programming
    13 years 8 months ago
    Approximate Graph Coloring by Semidefinite Programming
    Download  www.hirata.nuee.nagoya-u.ac.jp
    David R. Karger, Rajeev Motwani, Madhu Sudan
    claim paper
    Read More »
    ISAAC
    1998
    Springer
    88views Algorithms» more  ISAAC 1998»
    Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
    13 years 9 months ago
    Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
    Download  www.cs.brown.edu
    Philip N. Klein, Hsueh-I Lu
    claim paper
    Read More »
    MP
    2007
    73views more  MP 2007»
    Semidefinite programming relaxations for graph coloring and maximal clique problems
    13 years 4 months ago
    Semidefinite programming relaxations for graph coloring and maximal clique problems
    Download  www.core.ucl.ac.be
    Igor Dukanovic, Franz Rendl
    claim paper
    Read More »
    IPCO
    2008
    221views Optimization» more  IPCO 2008»
    A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
    13 years 6 months ago
    A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
    Download  www-user.tu-chemnitz.de
    Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
    Michael Armbruster, Marzena Fügenschuh, Chris...
    claim paper
    Read More »
    JDA
    2008
    88views more  JDA 2008»
    Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
    13 years 4 months ago
    Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
    Download  www.lamsade.dauphine.fr
    The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
    Cristina Bazgan, Zsolt Tuza
    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.