135
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
157
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
ESA
2006
Springer
15 years 6 months ago
2006
Springer
ESA
2006
Springer
15 years 6 months ago
2006
Springer
128
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...