Titlebook: Combinatorial Optimization and Applications; 9th International Co Zaixin Lu,Donghyun Kim,Ding-Zhu Du Conference proceedings 2015 Springer I

吸引人的花招

ACRID

fastness

Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Lineem with axis-parallel squares, where . is the number of squares and side lengths of the squares vary from 1 to .. We also prove that when the given objects are unit-height rectangles, both the hitting set and set cover problems are .-complete. For the same set of objects, we prove that the independent set problem can be solved in polynomial time.

原諒

易碎

PANIC

Homocystinuria

Improved Algorithms for the Evacuation Route Planning Problemd algorithm ., whose evacuation time is always at most that of a famous algorithm ., and whose running time is strictly less than that of CCRP. We prove this mathematically and give supporting results by extensive experiments. We also study randomized behavior model of people and give some interesting results.

Receive

photophobia

Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D “just barely” 3D in the sense that it only places tiles in the . and . planes. Our result is essentially a just-barely 3D temperature 1 simulation of a similar 2D temperature 2 result by Soloveichik and Winfree (SICOMP 2007).

diathermy

Line Segment Covering of Cells in Arrangementsrangement. For the latter problem we also show that it is fixed parameter tractable with respect to the size of the optimal solution. Finally we provide a linear time algorithm for the case where cells of the arrangement are created by recursively subdividing a rectangle using horizontal and vertical cutting segments.