Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ASIAN
1999
Springer

favoriteEmaildiscussreport

86views Algorithms» more ASIAN 1999»

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

13 years 8 months ago

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

Download www.dsi.uniroma1.it

Tiziana Calamoneri, Irene Finocchi, Yannis Manouss

Real-time Traffic

Algorithms | ASIAN 1999 |

claim paper

Related Content

» Partition into cliques for cubic graphs Planar case complexity and approximation

» A Simple Topology Preserving MaxFlow Algorithm for Graph Cut Based Image Segmentation

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Extending Continuous Cuts Anisotropic Metrics and Expansion Moves

» Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» A Gradient Descent Approximation for Graph Cuts

» Optimal 3terminal cuts and linear programming

» Balanced graph partitioning

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	ASIAN
Authors	Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi

Comments (0)