Titlebook: Combinatorial Algorithms; 21st International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer Berlin Heidelberg

sphincter

討人喜歡

Single Parameter FPT-Algorithms for Non-trivial Games, this paper provides positive results regarding Nash equilibria. We show that consideration of sparse games or limitations of the support result in fixed-parameter algorithms with respect to one parameter only for the .. problem. That is, we show that a sample uniform Nash equilibrium in .-sparse im

atopic

The Complexity Status of Problems Related to Sparsest Cuts,(.)/(|.||.???.|). This problem is NP-hard. The proof can be found in [16]. In the case of unit capacities (i. e. if .(.)?=?1 for every .?∈?.) the problem is to minimize |.(.,.???.)|/(|.||.???.|) over all subsets .???.. While this variant of the sparsest cut problem is often assumed to be NP-hard, th

Fraudulent

On Approximation Complexity of Metric Dimension Problem,imension problem is not approximable within . for any ., unless ., and we give an approximation algorithm which matches the lower bound. Even for bounded degree instances it is APX-hard to determine (compute) the exact value of the metric dimension which we prove by constructing an approximation pre

支柱

cathartic

大門在匯總

Computing Role Assignments of Proper Interval Graphs in Polynomial Time,morphism is also called an .-role assignment of .. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The . problem has as input a pair of graphs (.,.) and asks whether . has an .-role assignment. This problem is .-complete already on in

妨礙

Incommensurate

Flounder