632 search results - page 63 / 127 » On the Approximability of the Steiner Tree Problem |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
COMCOM
2010
13 years 9 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...