Sciweavers

WEA
2007
Springer
95views Algorithms» more  WEA 2007»
14 years 5 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
14 years 5 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 5 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 5 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
WEA
2007
Springer
178views Algorithms» more  WEA 2007»
14 years 5 months ago
Engineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
Peter Sanders, Dominik Schultes
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 5 months ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
14 years 5 months ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 5 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
WEA
2007
Springer
110views Algorithms» more  WEA 2007»
14 years 5 months ago
Exact Algorithms for the Matrix Bid Auction
Dries R. Goossens, Frits C. R. Spieksma
WEA
2007
Springer
131views Algorithms» more  WEA 2007»
14 years 5 months ago
On the Cost of Persistence and Authentication in Skip Lists
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...
Michael T. Goodrich, Charalampos Papamanthou, Robe...