Titlebook: Algorithms for Sensor Systems; 9th International Sy Paola Flocchini,Jie Gao,Friedhelm Meyer auf der He Conference proceedings 2014 Springer

GEN

反话

PATHY

neuron

0302-9743 d in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.978-3-642-45345-8978-3-642-45346-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

HARD

https://doi.org/10.1007/978-3-662-01424-0ce-augmented algorithms for several variants of the problem. Among others, we show that the decision problem is NP-hard already for a single source, and we present a 2-approximation algorithm for the problem of finding the minimum energy that can be assigned to each agent such that the agents can deliver the data.

遗产

Aufgaben und Elemente der Vorrichtungen,roblem is fixed-parameter tractable (FPT) for such regions. Using our FPT algorithm, we show that if the regions are .-fat and their arrangement has bounded ply ., there is a .-approximation that runs in . time, where ..

彩色的蜡笔

Data Delivery by Energy-Constrained Mobile Agents,ce-augmented algorithms for several variants of the problem. Among others, we show that the decision problem is NP-hard already for a single source, and we present a 2-approximation algorithm for the problem of finding the minimum energy that can be assigned to each agent such that the agents can deliver the data.

VALID

On the Complexity of Barrier Resilience for Fat Regions,roblem is fixed-parameter tractable (FPT) for such regions. Using our FPT algorithm, we show that if the regions are .-fat and their arrangement has bounded ply ., there is a .-approximation that runs in . time, where ..

利用

Das Arbeiten mit den Vorrichtungen,onary obstacles, we prove that it is NP-hard to decide whether a given initial configuration can be transformed into a desired target configuration. On the positive side, we provide constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations.

易碎

https://doi.org/10.1007/978-3-662-41823-9t that pebbles have eventually to be placed at: (i) a set of vertices that form a . subgraph of the . induced by ., say . (.), and (ii) a set of vertices that form a . of . (.). We will show that these two problems are actually hard to approximate, even for the seemingly simpler case in which the hop distance is considered.