Sciweavers

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...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 5 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 5 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
WEA
2007
Springer
120views Algorithms» more  WEA 2007»
14 years 5 months ago
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Mohammad Farshi, Joachim Gudmundsson
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
14 years 5 months ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
14 years 5 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...