/***
##############################
# Identification of the news #
##############################
# DO NOT MODIFY
name: Claire-Mathieu-colloquium-approximation-algorithms
date: 2018-06-01


################
# General data #
################

# the picture address, in dokuwiki or web syntax
picture = :actualites:ressources:logo-college-de-france-blason.png

# the name displayed when hovering over the picture (optional)
picture tag = Collège de France

# the link to be followed when clicking on the picture (optional)
picture link = https://www.college-de-france.fr/site/college/index.htm

# the link in the circled arrow icon (optional)
extra link = https://www.college-de-france.fr/media/claire-mathieu/UPL4334763547656001017_Claire_Mathieu___Colloque___V2.pdf


#######################
# Visibility/priority #
#######################
#
# This part describes when the news should be visible, and with what priority (how high in the list).
#

for 2 months until 2018-06-07, priority= low

#
# Other intervals of priority can/have to be specified.
#
# As a rule of thumb:
#  - priority high for up to 3 days, 10 days for very important events (FOCS) (appears top of the list)
#  - priority normal for up to 2 or 3 weeks (appears with high probability)
#  - priority low for as long as one wishes (probably invisible but sometimes can be if there is sufficient space)
#  - priority null makes the news invisible
#  - priorities may change several times (e.g. high for registration and for the event)
#  - this syntax can also be used for changing pictures, links, ...
#
# The syntax is the following
#   from DATE until DATE, priority= PRIORITY
#   from DATE for DURATION, priority= PRIORITY
#   for DURATION until DATE, priority= PRIORITY
#
# PRIORITY: high | normal | low | null
#
# DATE:
#   NUMBER MONTH NUMBER   (e.g. 22 June 2018)
#   ???-??-??             (e.g. 2018-06-22)
#
# DURATION:
#   NUMBER (day|days|week|weeks|month|months|year|years)

##########
# notion #
##########
# if one wants to have a notion (a small text that unravels when clicked and is used to highlight a concept)
#
# notion = NOTION NAME
# notion text = {TEXT OF THE NOTION}

notion = approximation algorithm
notion text = {The approximation algorithms are algorithms that produce a solution that approximates the best possible solution of an optimization problem. While finding the optimal solution of practical problems is often infeasible, an approximation algorithm usually produces its solution in an efficient way and provides formal guarantees about the quality of the approximation. An example of such a problem is the so-called "traveling salesman problem" which consists in finding among all possible itineraries the shortest route that allows a salesman to visit a given set of cities and come back home.}


####################
# TEXT OF THE NEWS #
####################
***/
[[https://www.irif.fr/~claire|Claire Mathieu]] (IRIF associate member) organizes a 1-day colloquium  on [[https://www.college-de-france.fr/site/en-claire-mathieu/symposium-2017-2018.htm|Approximation algorithms and networks]] at Collège de France on **__June 7__**. This is part of the Chair in Informatics and Computational Sciences at College de France in association with INRIA.