Jaroslav Morávek

According to our database, Jaroslav Morávek authored at least 6 papers between 1972 and 1986.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1986

<i> NP </i> -Hard Problems in Hierarchical-Tree Clustering.

Mirko Krivánek, Jaroslav Morávek

Acta Informatica, 1986

1985

Linear comparison complexity of the n-cube membership problem.

Mirko Krivánek, Jaroslav Morávek

Proceedings of the Fundamentals of Computation Theory, 1985

Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.

Mirko Krivánek, Jaroslav Morávek

Proceedings of the Fundamentals of Computation Theory, 1985

1984

New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming.

Jaroslav Morávek, Pavel Pudlák

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1973

Computational Optimality of a Dynamic Programming Method.

Jaroslav Morávek

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

A localization problem in geometry and complexity of discrete programming.

Jaroslav Morávek

Kybernetika, 1972