2654 search results - page 337 / 531 » On Pairing Inversion Problems |
130
Voted
ALGORITHMICA
2010
15 years 5 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
153
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
144
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
100
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...
125
Voted
DM
2010
15 years 5 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...