Campus Event Calendar: Jochen Könemann (11/12/1997 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

Fast and simple algorithms for maximum concurrent flow

Jochen Könemann

AG1 Mittagsseminar

AG 1

AG Audience

English

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

Date, Time and Location

Wednesday, 12 November 97

13:30

60 Minutes

024

Saarbrücken

Abstract

Given a multicommodity flow problem with demands the maximum concurent flow problem is to determine the largest fraction of the demands that can be routed concurrently. The problem can be solved in polynomial time by formulating as a linear program.

In this talk I will present a simple combinatorial algorithm to solve the problem.

Contact

Jochen Koenemann

--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:

network problems, multicommodity flow

Imprint / Impressum | Data Protection / Datenschutzhinweis