Sciweavers

85 search results - page 1 / 17
» On Minimum Circular Arrangement
Sort
View
STACS
2004
Springer
13 years 10 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
IEICET
2007
97views more  IEICET 2007»
13 years 5 months ago
A Circular Aperture Array Configuration with a Small Antenna Radius
In this paper, small sized array configurations with small number of element are investigated. As the antenna size, the diameter less than 3λo is assumed. The investigated config...
Takanori Noro, Yasuhiro Kazama, Masaharu Takahashi...
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
13 years 5 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner
STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 5 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...
COR
2008
118views more  COR 2008»
13 years 5 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...