Algorithms and networks fall 2009
This presentation is the property of its rightful owner.
Sponsored Links
1 / 20

Algorithms and networks Fall 2009 PowerPoint PPT Presentation


  • 53 Views
  • Uploaded on
  • Presentation posted in: General

Algorithms and networks Fall 2009. Today. Graphs and networks and algorithms: what and why? This course: organization Case introduction: facility location problems Shortest path I. What and why?. Started in 1736 with paper by Euler: bridges of Königsberg

Download Presentation

Algorithms and networks Fall 2009

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Algorithms and networks fall 2009

Algorithms and networksFall 2009


Today

Today

  • Graphs and networks and algorithms: what and why?

  • This course: organization

  • Case introduction: facility location problems

  • Shortest path I


What and why

What and why?


Graphs

Started in 1736 with paper by Euler: bridges of Königsberg

Can we make a walk where we cross each bridge once (Euler-tour)?

Graphs


Networks

Networks

  • Graphs are a model for many things in the real world:

    • Road networks, electrical networks, organizational diagrams, social networks, structure of software, data bases, …

  • Often with additional information: network is graph with some extra info (like weights, lengths, labels, …)


Problems

Problems

  • Often, we want to compute something on the network, motivated from the application (or theoretical curiosity).

  • How good and fast can we let the computer do this computation?


Algorithms and complexity

Algorithms and complexity

  • Algorithms

    • Exact, heuristic, special case

    • Polynomial time, exponential time, …

  • Complexity

    • NP-completeness, other classes


Techniques

Techniques

  • Combinatorial algorithms

  • Branch and bound

  • Local search (iterative improvement, simulated annealing, tabu search, …)

  • (Integer) linear programming


Model and algorithm

Model and algorithm

  • Real life problem

  • Mathematical model of real life problem

  • Algorithm for mathematical model

  • Solution produced by algorithm

  • Translation of solution to solution for real life problem


This course organization

This course (organization)


Teacher 1

Teacher 1

  • Marinus Veldhorst

  • [email protected]

  • 030-2534450

  • CGN office A310


Teacher 2

Teacher 2

  • Hans Bodlaender

  • [email protected]

  • 030-2534409

  • Kamer A302 CGN


Algorithms and networks

Algorithms and networks

  • 2 times per week lectures

  • 8 sets of exercises

    • Two weeks time for handing in

  • 2 partial exams


Final grade

Final grade

  • (Average exercise sets *2 + 1e exam + 2e exam)/4

  • Assuming

    • Exercise sets at least 6

    • Average exams at least 5


Exercise sets

Exercise sets

  • 8 sets

  • Grade

  • Hand in on paper, before or on deadline

  • Dutch or English

  • Write clear, legible, etc.

  • Unreadable, messy: 0


Purpose of course

Purpose of course

  • Knowing and being able to use and apply

    • Important algorithmic techniques

    • Important algorithms

    • Modelling

  • In particular for combinatorial problems involving graphs and networks


Topics

Topics

  • Algorithms

    • Modeling, principles (PTAS, NP-completeness)

    • Graph and Network algorithms

      • Paths (shortest paths, TSP)

      • Flow (max flow, min cost flow)

      • Matching (and stable marriage)

      • Trees (finding Steiner tree, exploiting treewidth,…)

      • Small world graphs (six degrees of separation)

      • Facility location (dominating set problem)

      • Mobile communication (algorithms for unit disk graphs, frequency assignment problem)


The website of this course

The website of this course

  • See www.cs.uu.nl/docs/vakken/an for

    • Powerpoint files

    • Exercises

    • Schedules

    • Dates, etc


Studying this course

Studying this course

  • Be there!

    • Materials are scattered literature: often hard to study at home if you were not at the course

    • If you are not at the course: borrow/copy notes of other students!

  • Make notes

  • Do your exercises

    • Preferably before the corresponding exam, even when the deadline is later!

  • Use the powerpoints and pdf’s


Exercises

Exercises

  • Hand-in on paper

  • Use folder

  • Once during course you can extend your deadline with three days (joker-rule)


  • Login