# Maximum cut

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- ACM Trans. Algorithms
- 2017

Even though local search heuristics are the method of choice in practice for many well-studied optimization problems, most of… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- ICDM
- 2001

An important application of graph partitioning is data clustering using a,graph model the pairwise similarities between all data… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IEEE Trans. Pattern Anal. Mach. Intell.
- 2000

ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- J. ACM
- 1996

This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. ACM
- 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- SIAM J. Comput.
- 1994

In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for… (More)

Is this relevant?

1994

1994

- STACS
- 1994

The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Math. Program.
- 1993

We introduce and study an eigenvalue upper bound p(G) on the maximum cut mc (G) of a weighted graph. The function ~o(G) has… (More)

Is this relevant?

1990

1990

- IEEE Trans. Computers
- 1990

Absfmcf-We consider the real-weight maximum cut of a planar graph. Given an undirected planar graph with real-valued weights… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Theor. Comput. Sci.
- 1985

The problem of clustering a set of points so as to minimize the maximum intercluster distance is studied. An O(kn) approximation… (More)

Is this relevant?