MFO
Advanced Search…
  • For Guest Researchers
  • Library
  • Scientific Program
  • About the Institute
  • Outreach & Media
You are here:
  1. Home
  2. Scientific Program
  3. Annual Schedules
  4. Approximation Algorithms for NP-Hard Problems

Approximation Algorithms for NP-Hard Problems Workshop Details https://www.mfo.de/@@site-logo/mfo.png

Approximation Algorithms for NP-Hard Problems

6 Jun - 12 Jun 2004
ID: 0424
Organizers
Ravi Kannan, Yale
Marek Karpinski, Bonn
Hans Jürgen Prömel, Berlin

Workshop Reports

  • Workshop Report 28/2004

Lookup workshop in oberwolfach photo collection

Navigation
  • Meetings
  • Longer Term Researchers
  • Prizes
  • Leibniz Network MMS
  • Publications
  • Online Offerings
  • Annual Schedules
    • Approximation Algorithms for NP-Hard Problems
  • Login for organizers
  • Login for participants
  • Grants
Timezone Information
World Clock
Timezone Converter to Oberwolfach time

For Guest Researchers

Information for invited researchers
Pandemic measures
Login for organizers
Login for participants
During your stay
After your stay
Information for applicants and proposers
For early career researchers
FAQ
Statement for Respect and Collegiality

Library

Search & Find
Electronic Resources
Services & Publishing
Book Exhibition Program
Library Profile

Scientific Program

Meetings
Longer Term
Prizes
Leibniz Network MMS
Publications
Online Offerings
Annual Schedules
Grants

About the Institute

Mission
Guiding Principles
History
Structure
Funding
Director
Staff
Contact
News

Outreach & Media

Oberwolfach Photo Collection
Oberwolfach Lectures
Snapshots
MiMa
Imaginary
swMATH
Education
Prizes

Leibniz Logo

  • Site Map
  • Accessibility
  • Datenschutz - Privacy
  • Impressum - Legal Notice