Sciweavers

446 search results - page 39 / 90
» A Combinatorial Theorem for Trees
Sort
View
IPL
2006
97views more  IPL 2006»
14 years 11 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
JUCS
2008
172views more  JUCS 2008»
14 years 11 months ago
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
PPSN
2010
Springer
14 years 10 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
DAM
2000
126views more  DAM 2000»
14 years 11 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...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 10 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...