Titlebook: WALCOM: Algorithms and Computation; 5th International Wo Naoki Katoh,Amit Kumar Conference proceedings 2011 Springer Berlin Heidelberg 2011

Insul岛

进步

勤勉

-Level Crossing Minimization Is ,-Hard for Treesquadratic time. We also show that the .-level crossing minimization problem for trees for an arbitrary number of levels is .-Hard. This result exposes a source of difficulty for algorithm designers that compounds earlier results relating to the 2-level crossing minimization problem for graphs.

lobster

-Level Crossing Minimization Is ,-Hard for Treesquadratic time. We also show that the .-level crossing minimization problem for trees for an arbitrary number of levels is .-Hard. This result exposes a source of difficulty for algorithm designers that compounds earlier results relating to the 2-level crossing minimization problem for graphs.

inhumane

Range-Aggregate Queries Involving Geometric Aggregation Operationsrsection, 2-d orthogonal segment intersection (with/without distance constraint) are revisited and we . the existing results for these problems. We also provide . solutions to some of these problems. This paper is the first attempt to provide dynamic solutions to problems involving geometric aggregation operations.