Titlebook: Algorithmic Aspects in Information and Management; 10th International C Qianping Gu,Pavol Hell,Boting Yang Conference proceedings 2014 Spri

享乐主义者

Eigenschaften der TyphusbazillenWe study the parameterized complexity of the following . problem: Given a graph . and an integer . as parameter, determine whether . can be modified into a split graph by contracting at most . edges. We show that . can be solved in FPT time ., but admits no polynomial kernel unless . ⊆ ./..

CALL

羽毛长成

Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Schemedensity . to detect this event region, i.e., its boundary. The model of sensor is a 0-1 sensor that decides whether it lies in . or not, and which might be incorrect with probability .. It also collects information on the 0-1 values of the neighbors within some distance . and revises its decision by

jocular

On the Exact Block Cover Problemas a factor .(log.log..) and it was shown most recently that it is FPT (but with a very high running time). In this paper, we consider the decision version of the one-sided MCSP problem (formally called the . problem); namely, when one sequence is already partitioned into . blocks, how to decide whe

统治人类

Minimax Regret k-sink Location Problem in Dynamic Path Networksthe proposed problem, where . is the number of vertices. In this paper, we study the general problem, i.e., minimax regret .-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an . time algorithm for the general problem, where . is t

针叶

Competitive Algorithms for Unbounded One-Way Tradingor each .., the amount of product to be sold to .. at the then-prevailing market price ... The objective is to maximize the seller’s revenue. We note that most previous algorithms for the problem need to impose some artificial upper bound . and lower bound . on the market prices, and the seller need

FLINT

Cerumen

Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Tiize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.

lymphoma

Nuance