Sciweavers

106 search results - page 8 / 22
» SDP-Based Algorithms for Maximum Independent Set Problems on...
Sort
View
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
TC
1998
13 years 7 months ago
Resilient Authentication Using Path Independence
—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...
Michael K. Reiter, Stuart G. Stubblebine
BMCBI
2010
185views more  BMCBI 2010»
13 years 2 months ago
MetaPIGA v2.0: maximum likelihood large phylogeny estimation using the metapopulation genetic algorithm and other stochastic heu
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...
Raphaël Helaers, Michel C. Milinkovitch
CPAIOR
2005
Springer
14 years 1 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee