Titlebook: Algorithms and Computation; 8th International Sy Hon Wai Leong,Hiroshi Imai,Sanjay Jain Conference proceedings 1997 Springer-Verlag Berlin

消滅

高貴領(lǐng)導(dǎo)

ALT

Formulation of the addition-shift-sequence problem and its complexity,tion, and it will be called the . problem. As a fundamental result on computational complexity, we show that the addition-shift-sequence problem is NP-complete. Then, we show lower and upper bounds of the number of operations for some particular sequence, where some techniques specific to our model are demonstrated.

stress-response

GILD

Multi-color routing in the undirected hypercube,y one of the . colors so that the paths of the same color are edge disjoint (each edge of . appears at most once in the paths of each single color). Let .. denote the .-dimensional hypercube, for arbitrary . ≥ 1. We show that a routing problem (.., .) always admits a four-colorable solution when . is a matching, i.e., its maximum degree is one.

分散

Competitive source routing on tori and meshes,e system load distribution. The cost we concern about is the maximum load among the edges. We use . to measure the performance of algorithms. We show that the competitive ratio for any algorithm is ,Ω(log .), and we provide an algorithm whose competitive ratio is .(log .).

有角

有法律效應(yīng)

adduction

Orthodontics