Skip to main content


eCommons@Cornell >

Browsing by Author Arkin, E.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 11 of 11
PreviewIssue DateTitleAuthor(s)
May-1991Approximate algorithms for the geometric covering salesman problemArkin, E.; Hassin, R.
Jul-1991Arrangements of line segments that share endpoints single face resultsArkin, E.; Halperin, D.; Kedem, K.; Mitchell, J. S. B.; Naor, N.
Sep-1988Beautification is HardArkin, E.
Sep-1988Complexity of the Multiple Product Single Facility Stockout Avoidance ProblemArkin, E.; Gallego, G.; Roundy, R.
Aug-1988Computational Complexity of Uncapacitated Multi-Echelon Production Plannin ProblemsArkin, E.; Joneja, D.; Roundy, R.
May-1991Link distance query problems in polygonsArkin, E.; Mitchell, J. S. B.; Suri, S.
Nov-1990Matching points into noise regions: combinatorial bounds and algorithmsArkin, E.; Kedem, K.; Mitchell, J. S. B.; Sprinzak, J.; Werman, M.
Mar-1989On Monotone Paths Among Obstacles with Applications to Planning AssembliesArkin, E.; Connelly, R.; Mitchell, J.
Jun-1987An Optimal Visibility Algorithm for A Simple Polygon with Star-Shaped HolesArkin, E.; Mitchell, J.
Jul-1988A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional WeightsArkin, E.; Roundy, R.
Jan-1988Weighted-Tardiness Scheduling with Weights Proportional to Processing TimesRoundy, R.; Arkin, E.
Showing results 1 to 11 of 11


© 2014 Cornell University Library Contact Us