Elisabeth Gaar,Melanie Siebenhofer,Angelika Wiegele
Elisabeth Gaar
Finding the stability number of a graph, i.e., the maximum number of vertices of which no two are adjacent, is a well known NP-hard combinatorial optimization problem. Since this problem has several applications in real life, there is need ...
Mirjam Groote Schaarsberg,Hans Reijnierse,Peter Borm
Mirjam Groote Schaarsberg
This paper introduces mutual liability problems, as a generalization of bankruptcy problems, where every agent not only owns a certain amount of cash money, but also has outstanding claims and debts towards the other agents. Assuming that t...
Andreas Darmann
Andreas Darmann
We apply the well-known Condorcet criterion from voting theory outside of its classical framework and link it with spanning trees of an undirected graph. In situations in which a network, represented by a spanning tree of an undirected grap...
Charles Knessl,Johan S H van Leeuwaarden
Charles Knessl
We consider the Erlang A model, or [Formula: see text] queue, with Poisson arrivals, exponential service times, and m parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length pr...