3875 search results - page 208 / 775 » Approximation algorithms for the 0-extension problem |
130
click to vote
WINE
2009
Springer
16 years 19 days ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
153
click to vote
SPLC
2008
15 years 7 months ago
2008
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
169
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
133
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
135
click to vote
TWC
2008
15 years 6 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...