#### Filter Results:

#### Publication Year

1995

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

1 Introduction The maximum cut problem this paper deals with can be formulated as follows. Given an undirected simple graph G = (V, E) where V and E stand for the node and edge sets respectively, and given weights assigned to the edges: (w ij) ij∈E , a cut δ(S), with S ⊆ V is deened as the set of edges in E with exactly one endnode in S, i.e. δ(S) = {ij ∈ E… (More)