500 search results - page 6 / 100 » Approximation algorithms for maximum independent set of pseu... |
101
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
TC
1998
14 years 9 months ago
1998
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
DIS
2007
Springer
15 years 4 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...