Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Some Approximability Results on Delivering Messages with Mobile Agents
Speaker:Mirko Rossi
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Monday, 24 June 2019
Time:13:00
Duration:30 Minutes
Location:Saarbrücken
Building:E1 4
Room:024
Abstract
We study the problem of delivering $m$ messages between specified source-target pairs in a weighted undirected graph using $k$ mobile agents. Each agent is initially located on some node of the graph and it consumes an amount of energy that is proportional to the distance it travels. The goal is to minimize either the total energy consumption or the maximum energy consumption per agent. In both case we consider agents with different rates of energy consumption. In the scenario where we want to minimize the total energy consumption, we provide (i) a fixed-parameter algorithm w.r.t. the number of agents achieving a constant approximation ratio, and (ii) a polynomial-time $O(k)$-approximation algorithm. When the objective function is to minimize the maximum energy consumption, we show that the problem cannot be approximated within a factor better than $\frac{3}{2}$.
Contact
Name(s):Nitin Saurabh
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created:
Nitin Saurabh, 06/11/2019 02:44 PM
Last modified:
Uwe Brahm/MPII/DE, 06/24/2019 07:01 AM
  • Nitin Saurabh, 06/21/2019 01:38 PM
  • Nitin Saurabh, 06/11/2019 02:44 PM -- Created document.