18306 search results - page 80 / 3662 » Algorithmics in Exponential Time |
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
133
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first main
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Call holding times in telephony networks are commonly approximated by exponential distributions to facilitate traffic engineering. However, for traffic engineering of cellular n...