• Publications
  • Influence
Approximation Schemes for the Restricted Shortest Path Problem
  • Refael Hassin
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1 February 1992
This note contains two fully polynomial approximation schemes for the shortest path problem with an additional constraint. Expand
  • 560
  • 58
To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems
Preface. 1. Introduction. 2. Unobservable Queues. 3. Competition Among Servers. 4. Reneging and Jockeying. 5. Schedules and Retrials. Expand
  • 584
  • 57
  • PDF
Approximation Algorithms for the Geometric Covering Salesman Problem
We introduce a geometric version of the Covering Salesman Problem: Each of the salesman's clients specifies a neighborhood in which they are willing to meet the salesman. Expand
  • 286
  • 41
Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
Queueing systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems. Expand
  • 149
  • 18
  • PDF
Approximation algorithms for hitting objects with straight lines
In the hitting set problem one is given m subsets of a finite set N and one has to find an X ⊂ N of minimum cardinality that “hits” (intersects) all of them. Expand
  • 97
  • 16
  • PDF
The swapping problem
We demonstrate several structural properties of shortest routes and develop polynomial approximation algorithms that are variations of a well-known "patching" algorithm for the traveling salesman problem. Expand
  • 86
  • 16
Approximation algorithms for maximum dispersion
We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Expand
  • 153
  • 14
Improved complexity bounds for location problems on the real line
In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line. Expand
  • 139
  • 13
To Queue or not to Queue
A push-pull amplifier consisting of a complementary pair of output transistors whose bases are interconnected by a resistor. According to the invention, the bases are separately connected to theExpand
  • 108
  • 13