Given an undirected graph with edge weights and a subset R of its edges, the Rural
Postman Problem (RPP) is to find a closed walk of minimum total weight containing all …

Makespan minimization (on parallel identical or unrelated machines) is arguably the most
natural and studied scheduling problem. A common approach in practical algorithm design …

We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric
Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed …

We study a problem of energy-efficiently connecting a symmetric wireless communication
network: given an n-vertex graph with edge weights, find a connected spanning subgraph of …

The cover design of this thesis incorporates three main elements that are closely related to
its content. Firstly, sunflowers are used to symbolize the Sunflower lemma, a key technical …

V bakalářské práci představíme problém Min Power Symmetric connectivity (MinPSC), který
je na obecných grafech NP-těžký. Problém MinPSC má uplatněni v sítích, kde pro daný uzel …