55 search results - page 2 / 11 » Tight Bounds for the Approximation Ratio of the Hypervolume ... |
IPPS
2005
IEEE
14 years 27 days ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
WADS
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
AAAI
2010
13 years 8 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
COCOON
2005
Springer
14 years 26 days ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...