7006 search results - page 935 / 1402 » Approximation Algorithms |
181
click to vote
FCT
2005
Springer
16 years 13 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
198
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
221
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
198
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
194
click to vote
MONET
2006
15 years 6 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...