Conference paper
Automating physical database design in a parallel database
Jun Rao, Chun Zhang, et al.
SIGMOD 2002
We show that the problem of exiting a degenerate vertex is as hard as the general linear programming problem. More precisely, every linear programming problem can easily be reduced to one where the second best vertex (which is highly degenerate) is already given. So, to solve the latter, it is sufficient to exit that vertex in a direction that improves the objective function value. © 1986 The Mathematical Programming Society, Inc.
Jun Rao, Chun Zhang, et al.
SIGMOD 2002
Ilan Adler, Nimrod Megiddo
Journal of the ACM
Ronald Fagin, Joseph Y. Halpern, et al.
Information and Computation
Daphne Koller, Nimrod Megiddo
Games and Economic Behavior