#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1978

2019

- This year (12)
- Last 5 years (23)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Christos H. Papadimitriou, Mihalis Yannakakis
- J. Comput. Syst. Sci.
- 1991

W e define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in fact contain several natural, well-studied ones. W e show that… (More)

With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of… (More)

- Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
- 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 a minimum weight set of edges that separates each terminal from all… (More)

We study problems in multiobjective optimization, in which solutions to a combinatorial optimization problem are evaluated with respect to several cost criteria, and we are interested in the… (More)

- Christopher P. Lund, Mihalis Yannakakis
- STOC
- 1993

We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering and other related minimization problems. Specifically, there is an c… (More)

- Mihalis Yannakakis
- STOC
- 1988

- Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis
- J. ACM
- 1983

A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been… (More)

- David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
- 26th Annual Symposium on Foundations of Computer…
- 1985

We investigate the complexity of finding locally optimal solutions to NP-hard combinatorial optimization problems. Local optimality arises in the context of local search algorithms, which try to find… (More)

- Robert E. Tarjan, Mihalis Yannakakis
- SIAM J. Comput.
- 1981