Titlebook: Combinatorial Optimization and Applications; 4th International Co Weili Wu,Ovidiu Daescu Conference proceedings 2010 Springer Berlin Heidel

滔滔不絕地說

Ahmed Nabil Belbachir,Peter Michael G?bell. Furthermore, there is no overlap between any two subtrees selected in the solution. We prove that this problem is NP-hard and present a fully polynomial-time approximation scheme (FPTAS) as a solution.

擁護者

小平面

孵卵器

Optometrist

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs,n polynomial time whenever . is odd, and NP-hard when . is even. Motivated by our use of hypergraphs, we define a class of hypergraphs which lies strictly in between the well studied classes of acyclic hypergraphs and normal hypergraphs.

構(gòu)成

結(jié)果

Coverage with ,-Transmitters in the Presence of Obstacles, . “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of .-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.

BOLT

不確定

countenance

Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks,is paper addresses the connected (or survivable) Constrained Surface-level Gateway Placement (C-SGP) problem for 3-D underwater acoustic sensor networks. Given a set of candidate locations where SGs can be placed, our objective is to place minimum number of SGs at a subset of candidate locations suc