Titlebook: Algorithms - ESA 2008; 16th Annual European Dan Halperin,Kurt Mehlhorn Conference proceedings 2008 The Editor(s) (if applicable) and The Au

郊外

IRK

Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Treeith minimum in-degree 3, ., where previously . was the best known bound. This bound is tight, and also holds for the larger class of digraphs with minimum in-degree 3 in which every arc is part of at least one out-branching.

含糊

讥讽

Der Enterprise Transformation Cycleudy of strongly connected cyclic level graphs. In particular, we present a linear time algorithm for the planarity testing and embedding problem, and we characterize forbidden subgraphs. Our results generalize earlier work on level graphs.

的阐明

Constantin Brunner,Lothar Bickelhe worst-case number of tetrahedra cannot be bounded as a function of .. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.

prediabetes

门窗的侧柱

A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetryh non-symmetric links. We show an improved upper bound of . on the competitive ratio of a simple greedy algorithm, for any request sequence of . terminals. The result almost matches the lower bound of . (where . is an arbitrarily small constant) due to Faloutsos . [8] and Angelopoulos [2].

信任

FAST

Decompositions and Boundary Coverings of Non-convex Fat Polyhedrahe worst-case number of tetrahedra cannot be bounded as a function of .. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.

档案

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. We also provide an improved bound trading off speed for additional machines..Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.