1653 search results - page 247 / 331 » Computer science and game theory |
93
Voted
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
143
Voted
HYPERTEXT
2009
ACM
15 years 8 months ago
2009
ACM
Collaborative annotation tools are in widespread use. The metadata from these systems can be mined to induce semantic relationships among Web objects (sites, pages, tags, concepts...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
101
click to vote
VRST
2006
ACM
15 years 5 months ago
2006
ACM
Instead of the reality in which you can see your own limbs, in virtual reality simulations it is sometimes disturbing not to be able to see your own body. It seems to create an is...
SIGECOM
2005
ACM
15 years 4 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...