Titlebook: LATIN 2012: Theoretical Informatics; 10th Latin American David Fernández-Baca Conference proceedings 2012 Springer-Verlag Berlin Heidelber

ANT

Chagrin

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems,ning time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are ..-. and . under vertex insertions and deletions.

伟大

削减

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks,ws that, in a system of . processes, .-renaming is strictly stronger than (. − 1)-set agreement, but not stronger than (. − 2)-set agreement. Furthermore, (. + 1)-renaming cannot solve even (. − 1)-set agreement. As a consequence, there are cases where set agreement and renaming are incomparable when looking at their power to implement each other.

Bereavement

柔美流畅

gout109

A Generalization of the Convex Kakeya Problem,a translate of each input segment. This can be seen as a generalization of Kakeya’s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(. log.)-time algorithm for our geometric alignment problem,

精确

Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines, save energy is the shut-down mechanism which puts the system into a sleep state when it is idle. No energy is consumed in this state, but a fixed amount of energy is required for a transition from the sleep state to the active state which is equal to . times the energy required for the execution of

镀金

rods366