Titlebook: Algorithm Theory - SWAT ‘94; 4th Scandianvian Wor Erik M. Schmidt,Sven Skyum Conference proceedings 1994 Springer-Verlag Berlin Heidelberg

galley

irreparable

Hallmark

可商量

禁止,切斷

Parallel and sequential approximation of shortest superstrings,atio and the approximation ratio. The well known and practical approximation algorithm is the sequential algorithm GREEDY. It approximates the shortest superstring with the compression ratio of 1/2 and with the approximation ratio of 4. Our main results are:

一起

Sequential and parallel algorithms for embedding problems on classes of partial ,-trees,ing of the types of graphs for which these problems are tractable, this paper introduces methods for solving problems on graphs. In particular, we make use of the tree-decomposition of the graph to apply techniques used to solve problems on trees to solve problems on partial .-trees.

腫塊

Conference proceedings 1994 events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America..The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (

expository

Computing depth orders and related problems, lies vertically below . then .. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If . is a set of . triangles whose .-projections are all ‘fat’, then a depth order for . can be computed in time . log... (ii) If . is

heterodox

MOAT