7129 search results - page 753 / 1426 » Approximation Algorithms for Treewidth |
194
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
186
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
180
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
221
click to vote
MOBICOM
2006
ACM
16 years 25 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
193
Voted
SIGECOM
2003
ACM
16 years 4 days ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...