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

邪惡的你

A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem,the real line, and a set of . sensors, each of which covers some subinterval of . and is powered with a battery of limited duration. The RSC problem consists in assigning a starting time to each sensor so that the whole interval . is covered for as long as possible. We assume that when a sensor is t

overture

LEVY

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems,and an instance?.′ resulting from a local perturbation of?. that consists of insertions or removals of a small number of data, we wish to use?OPT in order to solve?Π in?.’, either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with run

使激動(dòng)

Tailor

健忘癥

宣誓書(shū)

BUOY

An Equivariance Theorem with Applications to Renaming,one another to choose unique names from a much smaller name space..We show that lower bounds on the solvability of renaming in an asynchronous distributed system can be formulated as a purely topological question about the existence of an equivariant chain map from a “topological disk” to a “topolog

用肘

DNR215

Pseudorandomness of a Random Kronecker Sequence,e is the well-known discrepancy, whereas the other one, the Arnold measure, is less popular. Both describe the behaviour of the truncated sequence . formed with the first . terms, for .?→?∞. We perform a probabilistic study of the pseudorandomness of the sequence . (discrepancy and Arnold measure),