We introduce a new bidirectional search algorithm, SingleFrontier Bidirectional Search (SFBDS). Unlike traditional BDS which keeps two frontiers, SFBDS uses a single frontier. At a particular node weâ€¦ (More)

We show that the problem of finding the simplex of largest volume in the convex hull of n points in Q can be approximated with a factor of O(log d) in polynomial time. This improves upon theâ€¦ (More)

NODE-WEIGHTED STEINER FOREST is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices thatâ€¦ (More)

Moving target search (MTS) or the game of cops and robbers has a broad field of application reaching from law enforcement to computer games. Within the recent years research has focused on computingâ€¦ (More)

Moving target search or the game of cops and robbers has been given much attention during the last two decades. It is known that optimal solutions, given a n-cop-win graph, are computable inâ€¦ (More)

The classic stable set problem asks to find a maximum cardinality set of pairwise non-adjacent vertices in an undirected graph G. This problem is NP-hard to approximate with factor n1âˆ’Îµ for anyâ€¦ (More)

Abstract. We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP)â€¦ (More)

Anesthesia was induced in six patients scheduled for elective aortocoronary bypass (ACB) surgery with intravenous fentanyl, either 50 (n = 2) or 150 micrograms/kg (n = 4) over 20 or 60 sec,â€¦ (More)