Sciweavers

291 search results - page 18 / 59
» Factor 2 Approximation Algorithm for the Generalized Steiner...
Sort
View
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
NETWORKING
2007
13 years 8 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
APPROX
2005
Springer
88views Algorithms» more  APPROX 2005»
14 years 26 days ago
Approximating the Best-Fit Tree Under Lp Norms
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
Boulos Harb, Sampath Kannan, Andrew McGregor
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 1 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...