WEA
2010
Springer
14 years 6 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
WEA
2010
Springer
14 years 6 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
WEA
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
WEA
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
WEA
2010
Springer
14 years 6 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
SAC
2010
ACM
14 years 6 months ago
2010
ACM
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...
DASFAA
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract. Until recently algorithms continuously gained free performance improvements due to ever increasing processor speeds. Unfortunately, this development has reached its limit...
WALCOM
2010
IEEE
14 years 6 months ago
2010
IEEE
STACS
2010
Springer
14 years 6 months ago
2010
Springer
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
TACAS
2010
Springer
14 years 6 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...