24 search results - page 5 / 5 » Extending a matroid by a cocircuit |
177
Voted
WINE
2010
Springer
14 years 11 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
104
click to vote
IM
2008
15 years 1 months ago
2008
Abstract. Congestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not hav...
132
click to vote
SPW
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Ku...
118
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...