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:An efficient data structure for finding Pareto-optimal points (Bachelor thesis)
Speaker:Julian Dörfler
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Thursday, 22 February 2018
Time:13:00
Duration:30 Minutes
Location:Saarbrücken
Building:E1 4
Room:024
Abstract
We present a new data structure for maintaining a set of n d-dimensional points with insertion and deletion in time O(lg^{d-1}(n) lg lg(n)) and querying for the set of Pareto-maximal points in time O(k^{floor(d/2)} lg^{d-1}(n) lg lg(n)) where k denotes the number of Pareto-maximal points. We also present another version with update time O(n) and query time O(k).
Contact
Name(s):Karl Bringmann
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created:
Karl Bringmann, 02/01/2018 06:30 PM
Last modified:
halma/MPII/DE, 05/22/2019 12:01 AM
  • Karl Bringmann, 02/08/2018 02:18 PM
  • Karl Bringmann, 02/01/2018 06:30 PM -- Created document.