Eitan Zemel

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2010
j9		Anshul Sheopuri, Eitan Zemel: A note on the properties of the optimal solution(s) of the Greed and Regret problem. European Journal of Operational Research 204(3): 690-693 (2010)
	1993
j8		David L. Woodruff, Eitan Zemel: Hashing vectors for tabu search. Annals OR 41(2): 123-137 (1993)
	1992
j7		David Hartvigsen, Eitan Zemel: The Complexity of Lifted Inequalities for the Knapsack Problem. Discrete Applied Mathematics 39(2): 113-123 (1992)
	1989
j6		David Hartvigsen, Eitan Zemel: Is every cycle basis fundamental? Journal of Graph Theory 13(1): 117-137 (1989)
	1987
j5		Eitan Zemel: A Linear Time Randomizing Algorithm for Searching Ranked Functions. Algorithmica 2: 81-90 (1987)
	1986
j4		Nimrod Megiddo, Eitan Zemel: An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7(3): 358-368 (1986)
	1984
j3		Eitan Zemel: An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. Inf. Process. Lett. 18(3): 123-128 (1984)
	1982
j2		Eitan Zemel: Polynomial algorithms for estimating network reliability. Networks 12(4): 439-452 (1982)
	1981
j1		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. SIAM J. Comput. 10(2): 328-337 (1981)

Coauthor Index

1	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[j1]
2	David Hartvigsen	[j7] [j6]
3	Nimrod Megiddo	[j4] [j1]
4	Anshul Sheopuri	[j9]
5	Arie Tamir	[j1]
6	David L. Woodruff	[j8]

Last update Wed May 22 05:39:42 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page