Conference paper
Adaptive traitor tracing for large anonymous attack
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
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.
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
Nimrod Megiddo, Eitan Zemel
Journal of Algorithms
Edith Cohen, Nimrod Megiddo
Journal of the ACM (JACM)
Noga Alon, Nimrod Megiddo
Journal of the ACM (JACM)