Algorithms and Computation: ... International Symposium, ISAAC ... : ProceedingsSpringer-Verlag, 2001 - Computer algorithms |
Contents
Invited Talk | 1 |
Combinatorial Generation and Optimization | 14 |
for the Multivehicle Scheduling Problem | 36 |
Copyright | |
40 other sections not shown
Other editions - View all
Common terms and phrases
2-level approximation algorithm approximation scheme assume batch block broadcasting scheme c₁ called chain chordal graph Cmax competitive ratio completion component Computational Geometry Computer Science configuration connected consider construct convex corresponding counter cycle defined denote DG(G Discrete dynamic programming faulty floorplans function given graph G Hence input instance integer isomorphism Lemma length linear LNCS lower bound M-convex makespan maximum minimal minimum node NP-complete NP-hard OBDD obtained on-line algorithm optimal path optimal schedule output p-meager P₁ P4-components packet pair paper parameterized Parameterized Complexity partition perfect matching planar graph player polygon polynomial polynomial-time Proc processing processors Proof protein sequences protocol quantum quantum finite automata queue ratio regular expressions resp S₁ satisfies scheduling problem segment semi-normal semi-normal scheduling solution solved Springer-Verlag Step string subgraph subset T₁ Takaoka Eds testing rounds Theorem triangulation V₁ variables vector vertices