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

嫌恶

fringe

Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle,ove that for each given integer 1 ≤ . ≤ 5 there is a strongly connected spanner on the set of points so that each sensor uses at most . such directional antennae whose range differs from the optimal range by a multiplicative factor of at most .. Moreover, given a minimum spanning tree on the set of

不遵守

A Constant-Factor Approximation Algorithm for the Link Building Problem, new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless . = .. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naiv

restrain

adipose-tissue

Computational Study for Planar Connected Dominating Set Problem,] introduce a new technique to generate . time and fixed-parameter algorithms for a number of non-local hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results

蕨类

Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives,t whether it contains defectives or not. Strategies are preferred that use both a small number of tests close to the information-theoretic lower bound .log., and a small constant number of stages, where tests in every stage are done in parallel, in order to save time. They should even work if . is c

indenture

d-limonene

Approximation Algorithm for the Minimum Directed Tree Cover,th of them) of every arc in . is touched by .. The minimum directed tree cover problem (DTCP) is to find a directed tree cover of minimum cost. The problem is known to be .-hard. In this paper, we show that the weighted Set Cover Problem (SCP) is a special case of DTCP. Hence, one can expect at best

PANG

An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs,he . of a spanning star forest is the number of leaves in all its components. The goal of the . [12] is to find the maximum-size spanning star forest of a given graph..In this paper, we study this problem in .-dense graphs, where for . ∈ (0,1), a graph of . vertices is called . if it contains at lea

Nonthreatening