The workshop "Computational Geometry: Solving Hard Optimization Problems"
(CG:SHOP)
will take place as part of CG Week in Portland, OR, USA, June 18-21, 2019.
(See http://eecs.oregonstate.edu/socg19/workshops.html)
Contributions are sought in two different directions, as follows.
(1) OPTIMIZATION CHALLENGE: The objective is to compute good solutions to
instances of an NP-hard geometric optimization problem:
Given a set S of n points in the plane, compute a simple polygon, whose
vertex set is precisely
the set S, that has maximum or minimum area among all such
polygonalizations of S.
Details of the competition (including further details such as benchmark
instances, and rules for submission and evaluation) appear on
the website:
https://sites.google.com/stonybrook.edu/cgweek2019-workshop/
Contest opened 24:00 (midnight, CET), February 28, 2019.
Contest closes 24:00 (midnight, CET), May 31, 2019.
*We are encouraged by the submissions that have come in already, thanks!*
*NOTE: It is possible to update solutions, with ties broken by submission
time, so submit early and often!*
Winners will be recognized and invited to present during the workshop at CG
Week.
(2) OPEN PROBLEMS: We invite submissions for presentation during an open
problem session. Details of how to submit contributions are provided
through the website:
https://sites.google.com/stonybrook.edu/cgweek2019-workshop/
In order to allow sufficient time for collecting and preloading
presentations,
contributions are encouraged by June 11, 2019.
In addition, the workshop will host presentations and meta-discussions
about the future of open problems.
We are looking forward to your contributions and welcome questions and
comments!
Erik Demaine, Sándor Fekete, Joe Mitchell
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
