Titlebook: Algorithmic Aspects in Information and Management; 4th International Co Rudolf Fleischer,Jinhui Xu Conference proceedings 2008 Springer-Ver

arabesque

3 Saturated Monoethers, C10-C12,ch element .. (. = 1, ...,.) has a non negative cost ... A .. is a subset of .. We are also given a collection . of . sets of bundles. More precisely, each set .. (. = 1, ..., .) is composed of .(.) distinct bundles .. A solution to . is a subset . such that for every . at least one bundle is covere

虚情假意

2 Saturated Monoesters, C13-C15,ge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a s

手工艺品

grovel

3 Saturated Monoethers, C13-C22,trees by selecting . − 1 cut points along the edges of the underlying tree. The objective is to maximize (minimize) the minimum (maximum) length of the subtrees. We present an .(.log..)-time algorithm for the max-min problem which is based on parametric search technique [7] and an efficient solution

出处

Inexorable

2 Saturated Monoesters, C13-C15,arches for a “consensus permutation” that is “closest” to the given set of permutations. Computing an optimal consensus permutation is NP-hard. We provide first, encouraging fixed-parameter tractability results for computing optimal scores (that is, the overall distance of an optimal consensus permu