Esther Arkin - Academia.edu (original) (raw)

Papers by Esther Arkin

Research paper thumbnail of Decision trees for geometric objects

International Journal of Computational Geometry and Applications, 1998

Research paper thumbnail of On local search for weighted κ-set packing

Lecture Notes in Computer Science, 1997

Page 1. MATHEMATICS OF OPERATIONS RESEARCH Vol. 23, No. 3, August 1998 Printed in USA ON LOCAL SE... more Page 1. MATHEMATICS OF OPERATIONS RESEARCH Vol. 23, No. 3, August 1998 Printed in USA ON LOCAL SEARCH FOR WEIGHTED k-SET PACKING ESTHER M. ARKIN AND REFAEL HASSIN ... We call a cycle of length ga small cycle. ...

Research paper thumbnail of Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06, 2006

Research paper thumbnail of Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms, 2006

We consider a variety of vehicle routing problems. The input to a problem consists of a graph G =... more We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N;E) and edge lengths l(e) e 2 E. Customers located at the vertices have to be visited by a set of vehicles. Two important parameters are k the number of vehicles, and ‚ the longest distance traveled by a vehicle. We

Research paper thumbnail of Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

Research paper thumbnail of The Lazy Bureaucrat scheduling problem

Information and Computation, 2003

Research paper thumbnail of Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights

Operations Research, 1991

Research paper thumbnail of An Efficiently Computable Metric for Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986

Research paper thumbnail of Algorithms for two-box covering

Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06, 2006

Research paper thumbnail of When can you fold a map?

Computational Geometry, 2004

Research paper thumbnail of Resource-constrained geometric network optimization

Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1998

Research paper thumbnail of Matching points with geometric objects: Combinatorial results

Given a class C of geometric objects and a point set P ,a C- matching of P is a set M = {C1,...,C... more Given a class C of geometric objects and a point set P ,a C- matching of P is a set M = {C1,...,Ck} of elements of C such that every Ci contains exactly two elements of P. If all the elements of P belong to some Ci, M is called a perfect matching; if in addition all the elements of M are pairwise disjoint we say that this matching M is strong .I n this paper we study the existence and characteristics of C-matchings for point sets on the plane when C is the set of circles or the set of isothetic squares on the plane.

Research paper thumbnail of Shortest Tour of a Sequence of Disjoint Segments in L1

Given a sequence of K disjoint segments in the plane, a start point s and a target point t, we se... more Given a sequence of K disjoint segments in the plane, a start point s and a target point t, we seek a path that starts at s, visits in order each of the segments, and ends at t, such that the L1 length of the path is minimized. We give an O(K,) algorithm for the problem. As a by-product, our algorithm builds a data structure, of size O(K), such that the shortest path, visiting k flrst segments in the sequence, to any point in the plane can be output in O(k) time. Key words: Shortest tour, traveling salesman problem, linear programming 2

Research paper thumbnail of Capturing Crossings: Convex Hulls of Segment and Plane Intersections

We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly ( n2)) intersecti... more We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly ( n2)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn planes in d-dimensions whose arrangement has ( nd 1) intersection points on

Research paper thumbnail of Hamiltonian triangulations for fast rendering

The Visual Computer, 1996

Research paper thumbnail of Guest Editors' Foreword

International Journal of Computational Geometry and Applications - IJCGA, 1997

Research paper thumbnail of Optimal Covering Tours with Turn Costs

SIAM Journal on Computing, 2005

Research paper thumbnail of Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters, 1989

Recently there has been a flurry of research in the area of production planning for multi-echelon... more Recently there has been a flurry of research in the area of production planning for multi-echelon production-distribution systems with deterministic non-stationary demands and no capacity constraints. A variety of algorithms have been proposed to optimally solve these ...

Research paper thumbnail of Restricted delivery problems on a network

Research paper thumbnail of Modularity of cycles and paths in graphs

Journal of the ACM, 1991

Certain problems related to the length of cycles and paths modulo a given integer are studied. Li... more Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length P mod Q and whether all paths between two specified nodes are of length P mod Q, for fixed integers P.Q. These results are compared to those for

Research paper thumbnail of Decision trees for geometric objects

International Journal of Computational Geometry and Applications, 1998

Research paper thumbnail of On local search for weighted κ-set packing

Lecture Notes in Computer Science, 1997

Page 1. MATHEMATICS OF OPERATIONS RESEARCH Vol. 23, No. 3, August 1998 Printed in USA ON LOCAL SE... more Page 1. MATHEMATICS OF OPERATIONS RESEARCH Vol. 23, No. 3, August 1998 Printed in USA ON LOCAL SEARCH FOR WEIGHTED k-SET PACKING ESTHER M. ARKIN AND REFAEL HASSIN ... We call a cycle of length ga small cycle. ...

Research paper thumbnail of Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06, 2006

Research paper thumbnail of Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms, 2006

We consider a variety of vehicle routing problems. The input to a problem consists of a graph G =... more We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N;E) and edge lengths l(e) e 2 E. Customers located at the vertices have to be visited by a set of vehicles. Two important parameters are k the number of vehicles, and ‚ the longest distance traveled by a vehicle. We

Research paper thumbnail of Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

Research paper thumbnail of The Lazy Bureaucrat scheduling problem

Information and Computation, 2003

Research paper thumbnail of Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights

Operations Research, 1991

Research paper thumbnail of An Efficiently Computable Metric for Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986

Research paper thumbnail of Algorithms for two-box covering

Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06, 2006

Research paper thumbnail of When can you fold a map?

Computational Geometry, 2004

Research paper thumbnail of Resource-constrained geometric network optimization

Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1998

Research paper thumbnail of Matching points with geometric objects: Combinatorial results

Given a class C of geometric objects and a point set P ,a C- matching of P is a set M = {C1,...,C... more Given a class C of geometric objects and a point set P ,a C- matching of P is a set M = {C1,...,Ck} of elements of C such that every Ci contains exactly two elements of P. If all the elements of P belong to some Ci, M is called a perfect matching; if in addition all the elements of M are pairwise disjoint we say that this matching M is strong .I n this paper we study the existence and characteristics of C-matchings for point sets on the plane when C is the set of circles or the set of isothetic squares on the plane.

Research paper thumbnail of Shortest Tour of a Sequence of Disjoint Segments in L1

Given a sequence of K disjoint segments in the plane, a start point s and a target point t, we se... more Given a sequence of K disjoint segments in the plane, a start point s and a target point t, we seek a path that starts at s, visits in order each of the segments, and ends at t, such that the L1 length of the path is minimized. We give an O(K,) algorithm for the problem. As a by-product, our algorithm builds a data structure, of size O(K), such that the shortest path, visiting k flrst segments in the sequence, to any point in the plane can be output in O(k) time. Key words: Shortest tour, traveling salesman problem, linear programming 2

Research paper thumbnail of Capturing Crossings: Convex Hulls of Segment and Plane Intersections

We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly ( n2)) intersecti... more We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly ( n2)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn planes in d-dimensions whose arrangement has ( nd 1) intersection points on

Research paper thumbnail of Hamiltonian triangulations for fast rendering

The Visual Computer, 1996

Research paper thumbnail of Guest Editors' Foreword

International Journal of Computational Geometry and Applications - IJCGA, 1997

Research paper thumbnail of Optimal Covering Tours with Turn Costs

SIAM Journal on Computing, 2005

Research paper thumbnail of Computational complexity of uncapacitated multi-echelon production planning problems

Operations Research Letters, 1989

Recently there has been a flurry of research in the area of production planning for multi-echelon... more Recently there has been a flurry of research in the area of production planning for multi-echelon production-distribution systems with deterministic non-stationary demands and no capacity constraints. A variety of algorithms have been proposed to optimally solve these ...

Research paper thumbnail of Restricted delivery problems on a network

Research paper thumbnail of Modularity of cycles and paths in graphs

Journal of the ACM, 1991

Certain problems related to the length of cycles and paths modulo a given integer are studied. Li... more Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length P mod Q and whether all paths between two specified nodes are of length P mod Q, for fixed integers P.Q. These results are compared to those for