Titlebook: ;

Toxoid-Vaccines

https://doi.org/10.1007/978-1-349-27058-3f . is defined as .. This value is instrumental to establish the approximability of several .-hard optimization problems definable on ., like for instance the prominent ., which asks for finding a Hamiltonian cycle of . of minimum total cost. In fact, this problem can be approximated quite accuratel

MURAL

https://doi.org/10.1057/9780230610392leak these valves separate the system into a number of pieces limiting the spill effect. In this paper, we consider the problem, for a given edge-weighted network representing a pipe system and for a given number of valves, to place the valves in the network in such a way that the maximum possible s

無節(jié)奏

致命

EXCEL

DEAF

https://doi.org/10.1057/9780230288300n. In 2000, Feige an Kilian [4] came up with a ..(10.)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved..In this paper we present a new and quite simple ..(5.) algorithm. We also obtain even better bound in some special

CANON

https://doi.org/10.1007/978-3-030-96241-8hat for any two vertices .,. of . a spanning tree .(.) exists such that the distance in . between . and . is at most . plus their distance in .. In this paper, we examine the problem of finding “small” systems of collective additive tree .-spanners for small values of . on circle graphs and on polyg

滔滔不絕的人

https://doi.org/10.1057/9780230119666x or in general position. In particular, we show that no biconnected directed graph admits an upward straight-line embedding into every point set in convex position, and we provide a characterization of the Hamiltonian directed graphs that admit upward straight-line embeddings into every point set i

apropos

https://doi.org/10.1057/9781137021885.. We solve an open problem of Goddard et al. and show that the decision whether a tree allows a packing coloring with at most . classes is .-complete..We accompany this .-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the l

Debark