2766 search results - page 219 / 554 » Algorithms for trigonometric polynomials |
157
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
156
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
180
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
166
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
123
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...