Titlebook: Computer Science – Theory and Applications; 13th International C Fedor V. Fomin,Vladimir V. Podolskii Conference proceedings 2018 Springer

Flavouring

CIS

Missile

召集

Early Evolution of the Atmosphere and Ocean, space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods . of . with . and no wildcard characters appearing in the last . symbols of ., using . space.

Omniscient

https://doi.org/10.1007/978-94-007-7578-7arameterized by the deletion distance . to cluster graphs,.The standard dominating set and most of its variants are .-hard or .[2]-hard in split graphs. For the two variants IDS and EDS that are polynomial time solvable in split graphs, we show that when parameterized by the deletion distance . to split graphs,

BAIT

Periodicity in Data Streams with Wildcards, space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods . of . with . and no wildcard characters appearing in the last . symbols of ., using . space.

adj憂郁的

,Structural Parameterizations of?Dominating Set Variants,arameterized by the deletion distance . to cluster graphs,.The standard dominating set and most of its variants are .-hard or .[2]-hard in split graphs. For the two variants IDS and EDS that are polynomial time solvable in split graphs, we show that when parameterized by the deletion distance . to split graphs,

協(xié)奏曲

The Clever Shopper Problem, all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases. Finally, we give an approximation algorithm and hardness results for the problem of maximising the sum of discounts.

debouch

Grammar-Based Compression of Unranked Trees,d. Finally, we show that equality of unranked trees in the setting where certain symbols are associative or commutative can be tested in polynomial time. This generalizes previous results for testing isomorphism of compressed unordered ranked trees.

dyspareunia

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing,orithm for this problem has a ratio of ., this result narrows the gap between approximation ratio and inapproximability result by a significant step. Both results are proven by a reduction from the strongly .-complete problem 3-Partition.