Search the dblp DataBase

Publications of Author

1. Eitan Zemel
   A Linear Time Randomizing Algorithm for Searching Ranked Functions. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1987, v:2, n:, pp:81-90 [Journal]
   
2. David Hartvigsen, Eitan Zemel
   The Complexity of Lifted Inequalities for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:39, n:2, pp:113-123 [Journal]
   
3. Eitan Zemel
   An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1984, v:18, n:3, pp:123-128 [Journal]
   
4. Nimrod Megiddo, Eitan Zemel
   An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1986, v:7, n:3, pp:358-368 [Journal]
   
5. Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
   An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:328-337 [Journal]