Sciweavers

WEA
2004
Springer
150views Algorithms» more  WEA 2004»
13 years 10 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
13 years 10 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
13 years 10 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
13 years 10 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
WEA
2004
Springer
117views Algorithms» more  WEA 2004»
13 years 10 months ago
Approximating Interval Coloring and Max-Coloring in Chordal Graphs
Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Rama...
Algorithms
Top of PageReset Settings