1672 search results - page 18 / 335 » Tightness problems in the plane |
125
click to vote
SIGECOM
2008
ACM
15 years 1 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...
119
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
135
click to vote
ECCC
2010
15 years 15 days ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
107
click to vote
JACM
2007
15 years 1 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
111
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...