Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl

flimsy

Dipolmoment und Molekularstruktur, stable matching. In many large-scale applications of ., we seek to match as many agents as possible. This motivates the problem of finding a maximum cardinality matching in . that admits the smallest number of blocking pairs (so is “as stable as possible”). We show that this problem is NP-hard and

STELL

Ergebnisse der Exakten Naturwissenschaftenubject to certain degree constraints on the vertices of the subgraph. This paper considers two natural . problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph .?=?(.,.), with |.|?=?. and |.|?=?.. Our results, together with the defi

confederacy

小口啜飲