|
|
eCommons@Cornell >
Browsing by Author Arkin, E.
Showing results 1 to 11 of 11
| Preview | Issue Date | Title | Author(s) | | May-1991 | Approximate algorithms for the geometric covering salesman problem | Arkin, E.; Hassin, R. |
| Jul-1991 | Arrangements of line segments that share endpoints single face results | Arkin, E.; Halperin, D.; Kedem, K.; Mitchell, J. S. B.; Naor, N. |
| Sep-1988 | Beautification is Hard | Arkin, E. |
| Sep-1988 | Complexity of the Multiple Product Single Facility Stockout Avoidance Problem | Arkin, E.; Gallego, G.; Roundy, R. |
| Aug-1988 | Computational Complexity of Uncapacitated Multi-Echelon Production Plannin Problems | Arkin, E.; Joneja, D.; Roundy, R. |
| May-1991 | Link distance query problems in polygons | Arkin, E.; Mitchell, J. S. B.; Suri, S. |
| Nov-1990 | Matching points into noise regions: combinatorial bounds and algorithms | Arkin, E.; Kedem, K.; Mitchell, J. S. B.; Sprinzak, J.; Werman, M. |
| Mar-1989 | On Monotone Paths Among Obstacles with Applications to Planning Assemblies | Arkin, E.; Connelly, R.; Mitchell, J. |
| Jun-1987 | An Optimal Visibility Algorithm for A Simple Polygon with Star-Shaped Holes | Arkin, E.; Mitchell, J. |
| Jul-1988 | A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weights | Arkin, E.; Roundy, R. |
| Jan-1988 | Weighted-Tardiness Scheduling with Weights Proportional to Processing Times | Roundy, R.; Arkin, E. |
Showing results 1 to 11 of 11
|
