2944 search results - page 213 / 589 » Improving Bound Propagation |
156
click to vote
ECCC
2010
15 years 5 months ago
2010
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
128
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
190
click to vote
WAOA
2007
Springer
16 years 20 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
161
click to vote
MFCS
2005
Springer
16 years 1 days ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
149
click to vote
WINE
2005
Springer
16 years 1 days ago
2005
Springer
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...