Sciweavers

IPL
2002
105views more  IPL 2002»
13 years 3 months ago
Steiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
IPL
2002
60views more  IPL 2002»
13 years 3 months ago
s-partitions
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
William M. Y. Goh, Pawel Hitczenko, Ali Shokoufand...
IPL
2002
90views more  IPL 2002»
13 years 3 months ago
Recognition and dualization of disguised bidual Horn functions
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
IPL
2002
74views more  IPL 2002»
13 years 3 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
IPL
2002
59views more  IPL 2002»
13 years 3 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
IPL
2002
86views more  IPL 2002»
13 years 3 months ago
A semantics of sequence diagrams
We develop a formal semantics of sequence diagrams. The semantics is given in terms of our new temporal logic, named HDTL, which is designed to specify dynamically evolving system...
Seung Mo Cho, Hyung-Ho Kim, Sung Deok Cha, Doo-Hwa...
IPL
2002
79views more  IPL 2002»
13 years 3 months ago
A self-adjusting quality of service control scheme
We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients w...
Sheng-Tzong Cheng, Ing-Ray Chen
IPL
2002
107views more  IPL 2002»
13 years 3 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya
IPL
2002
71views more  IPL 2002»
13 years 3 months ago
Pancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
Toru Araki, Yukio Shibata
IPL
2002
65views more  IPL 2002»
13 years 3 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba