219 search results - page 41 / 44 » A Better Approximation Ratio for the Vertex Cover Problem |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
WECWIS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...