Campus Event Calendar: Zeev Nutov (12/18/1998 in 46.1

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

Special Interest Group on Approximation and Online Algorithms

Zeev Nutov

MPI

SIG Meeting: Approx+Online

AG 1, AG 2

AG Audience

English

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

Date, Time and Location

Friday, 18 December 98

11:00

-- Not specified --

46.1 - MPII

007

Saarbrücken

Abstract

Constructing a min-cost network that satisfies given connectivity

requirements is an important problem in network design.
In this talk I will discuss approximation algorithm for
several problems of this type. Among the techniques that will be
mentioned are the primal-dual method, rounding, and Edmond's
algorithm for finding min-cost k-edge disjoint arborescences.

Contact

Rudolf Fleischer

9325-119

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

Connectivity in Graps, Approximation Algorithms

Imprint / Impressum | Data Protection / Datenschutzhinweis