16404 search results - page 865 / 3281 » A set coverage problem |
220
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
229
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
206
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
226
click to vote
SDM
2010
SIAM
15 years 9 months ago
2010
SIAM
The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
161
click to vote
AIML
2004
15 years 9 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...