Volume 80; Issue 4

Information Processing Letters

Volume 80; Issue 4
1

Approximation algorithms for maximum linear arrangement

Refael Hassin, Shlomi Rubinstein
Journal:
Information Processing Letters
Year:
2001
Language:
english
File:
PDF, 92 KB
english, 2001
2

The maximum f-depth spanning tree problem

Jérôme Monnot
Journal:
Information Processing Letters
Year:
2001
Language:
english
File:
PDF, 113 KB
english, 2001
3

On approximating planar metrics by tree metrics

Goran Konjevod, R. Ravi, F.Sibel Salman
Journal:
Information Processing Letters
Year:
2001
Language:
english
File:
PDF, 92 KB
english, 2001
4

Set-based access conflict analysis of concurrent workflow definition

Minkyu Lee, Dongsoo Han, Jaeyong Shim
Journal:
Information Processing Letters
Year:
2001
Language:
english
File:
PDF, 77 KB
english, 2001
5

The RS-tree: An efficient data structure for distance browsing queries

Dong-Joo Park, Shin Heu, Hyoung-Joo Kim
Journal:
Information Processing Letters
Year:
2001
Language:
english
File:
PDF, 167 KB
english, 2001