Luzi Anderegg

Online train disposition: to wait or not to wait?

Abstract We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers waiting time.

Efficient algorithms for detecting regular point configurations

A set of n points in the plane is in equiangular configuration if there exist a center and an ordering of the points such that the angle of each two adjacent points w.r.t. the center is

Optimal placement of ad-hoc devices under a VCG-style routing protocol

\frac{360^{\circ}}{n}

Online train disposition: To wait or not to wait?1

, i.e., if all angles between adjacent points are equal. We show that there is at most one center of equiangularity, and we give a linear time algorithm that decides whether a given point set is in equiangular configuration, and if so, the algorithm outputs the center. A generalization of equiangularity is σ-angularity, where we are given a string σ of n angles and we ask for a center such that the sequence of angles between adjacent points is σ. We show that σ-angular configurations can be detected in time O(n4 log n).

ArticlesOnline train disposition: To wait or not to wait?1

Motivated by a routing protocol with VCG-style side payments, this paper investigates the combinatorial problem of placing new devices in an ad-hoc network such that the resulting shortest path distances are minimum. Here, distances reflect transmission costs that are quadratic in Euclidean distance. We show that the general problem of placing multiple new wireless devices, either with different or identical transmission ranges, is NP-hard under multiple communication requests. On the positive side, we provide polynomial-time algorithms for the cases with only one new device and/or one communication request. To that end, we define geometric objects that capture the general geometric structure of wireless networks.

Online train disposition

Abstract We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers waiting time.

Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Abstract We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers waiting time.

Online Train Disposition: To Wait or Not to Wait?

Abstract We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers waiting time.