2095 search results - page 158 / 419 » Improved pebbling bounds |
162
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
158
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
153
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
182
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
154
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...