Sciweavers

    55 search results - page 1 / 11
    » A Simple MAX-CUT Algorithm for Planar Graphs
    Sort
    View
    EVOW
    2004
    Springer
    141views Artificial Intelligence» more  EVOW 2004»
    A Hierarchical Social Metaheuristic for the Max-Cut Problem
    13 years 10 months ago
    A Hierarchical Social Metaheuristic for the Max-Cut Problem
    Download  www.escet.urjc.es
    This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
    Abraham Duarte, Felipe Fernández, Án...
    claim paper
    Read More »
    CPC
    2006
    110views more  CPC 2006»
    Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
    13 years 5 months ago
    Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
    Download  people.maths.ox.ac.uk
    Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
    Alexander D. Scott, Gregory B. Sorkin
    claim paper
    Read More »
    ECCC
    2000
    93views more  ECCC 2000»
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    13 years 5 months ago
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    Download  reference.kfupm.edu.sa
    We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
    Uriel Feige, Marek Karpinski, Michael Langberg
    claim paper
    Read More »
    STACS
    1994
    Springer
    148views Theoretical Computer Science» more  STACS 1994»
    On the Complexity of the Maximum Cut Problem
    13 years 9 months ago
    On the Complexity of the Maximum Cut Problem
    Download  igitur-archive.library.uu.nl
    The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
    Hans L. Bodlaender, Klaus Jansen
    claim paper
    Read More »
    COLOGNETWENTE
    2009
    98views Optimization» more  COLOGNETWENTE 2009»
    A Simple MAX-CUT Algorithm for Planar Graphs
    13 years 6 months ago
    A Simple MAX-CUT Algorithm for Planar Graphs
    Download  www.zaik.uni-koeln.de
    F. Liers, G. Pardella
    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.