1568 search results - page 10 / 314 » The problem of examination questions in algorithmics |
133
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
97
Voted
TCBB
2008
15 years 3 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
106
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
121
Voted
ICDT
2007
ACM
15 years 9 months ago
2007
ACM
Cryptographic techniques for reasoning about information leakage have recently been brought to bear on the classical problem of statistical disclosure control – revealing accurat...
149
click to vote
ECCC
2011
14 years 10 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...