274 search results - page 44 / 55 » The Polymatroid Steiner Problems |
91
Voted
UM
2009
Springer
15 years 4 months ago
2009
Springer
When developing an Adaptive Learning System (ALS), users are generally consulted (if at all) towards the end of the development cycle. This can limit users’ feedback to the chara...
87
Voted
WAOA
2004
Springer
15 years 2 months ago
2004
Springer
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
96
Voted
CCS
1998
ACM
15 years 1 months ago
1998
ACM
Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the op...
86
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
73
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...