Campus Event Calendar: J.-R. Sack (01/13/2000 in 46/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Weighted Shortest Path Problems

J.-R. Sack

Carleton University, Ottawa

AG1 Mittagsseminar

AG 1, AG 2

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Thursday, 13 January 2000

13:30

45 Minutes

024

Saarbrücken

Abstract

Shortest path problems find applications in a variety of areas incl. computational geometry, robotics, and GIS. Many interesting shortest path problems in particular weighted scenarios and/or in 3-d, have high time complexities or are NP-hard. Thus approximation algorithms are of interest. We give several practical algorithms with provable bounds on approximation accuracy.

Contact

J.-R. Sack

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Tags, Category, Keywords and additional notes

Keywords, Tags:

Algorithms; Shortest Path; Weighted Region; Approximation

Imprint / Impressum | Data Protection / Datenschutzhinweis