Titlebook: Algorithms and Complexity; 8th International Co Paul G. Spirakis,Maria Serna Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

scotoma

Conference proceedings 2013na, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

lymphoma

Approximation Algorithms for Disjoint ,-Paths with Minimum Activation Cost,activation functions from .. to {0,1}, where . is a constant-size domain. The goal is to find activation values .. for all .?∈?. of minimum total cost ∑?... such that the activated set of edges satisfies some connectivity requirements. Network activation problems generalize several problems studied

無法破譯

VOC

SOBER

Average Optimal String Matching in Packed Strings, able to efficiently search for all occurrences of the string(s) in a given text . of length .. In our model, we assume that text and patterns are tightly packed so that any single character occupies log. bits and thus any sequence of . consecutive characters in the text or the pattern occupies exac

蔑視

Parameterized Complexity of DAG Partitioning,.: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying undirected graph contains only one sink. Motivated by NP-hardness and hardness of approximation results, we consider the parameterized complexity of this problem. We show

緩和

Four Measures of Nonlinearity,t implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that four common measures, ., and ., are incomparable in th

雄偉

On the Characterization of Plane Bus Graphs,,.) of bus vertices . realized by single horizontal and vertical segments, and point vertices . that are connected orthogonally to the bus segments without any bend. The decision whether a bipartite graph admits a bus realization is NP-complete. In this paper we show that in contrast the question wh

褻瀆