Sciweavers

623 search results - page 1 / 125
» Efficient Algorithms for Two Generalized 2-Median Problems o...
Sort
View
ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
13 years 9 months ago
Efficient Algorithms for Two Generalized 2-Median Problems on Trees
Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Ch...
DAM
2000
126views more  DAM 2000»
13 years 4 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 8 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
BICOB
2009
Springer
13 years 11 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
13 years 6 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs