Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
The workshop is dedicated to the use, design and analysis of algorithms for
combinatorial optimization problems (either efficient optimal or efficient
approximation algorithms). It aims, in particular, at fostering the cooperation
among researchers in computer science, mathematics and operations research.
The workshop, to be held in Riga, Latvia, co-locates with FCT'2001.
Papers presenting original research in all areas of algorithmic research are
sought, including, but not limited to:
* computational complexity
* graph and network algorithms
* flow and routing algorithms
* coloring and partitioning
* cuts and connectivity
* packing and covering
* scheduling algorithms
* approximation algorithms
* inapproximability results
* on-line problems
* randomized algorithms
* integer programming
* semidefinite programming
* algorithmic geometry
* polyhedral combinatorics
* branch and bound algorithms
* cutting plane algorithms
* various applications
SUBMISSION GUIDELINES
Electronic submissions are solicited. A postscript file must be sent to
wea2001@lami.univ-evry.fr
The postscript file must be received by 11:59pm of March 14th for
your submission to be considered.
In extreme cases, contributions may be submitted by sending 6 hard
copies to:
Evripidis Bampis, WEA 2001
LaMI, Université d' Evry
Boulevard Mitterrand
91 025 Evry Cedex, France
Your hard copy submission must be received by March 14th (or postmarked
March 5th or earlier and sent by airmail) in order to be considered.
To strengthen the cooperation between researchers in computers science,
mathematics and operations research we allow two types of submissions.
You are invited to submit either
. a long paper with no more than 12 pages or
. a short paper with at most 2 pages.
Submissions should consist of: a cover page, with the author's full name,
address, fax number, e-mail address, a 100-word abstract and keywords;
the author(s) should also indicate whether the paper should be considered as
a computer science, mathematics, or operations research paper
(for electronic submission, this page should be in the form of
a separate ascii-only e-mail); an extended abstract describing
original research (with an optional appendix, with more details to be read/consulted at the discretion
of the program committee).
Simultaneous submission of the papers to other
conferences with published proceedings is not allowed.
It is expected that all accepted papers will be presented at the workshop.
PUBLICATION
The accepted papers from Computer Science will be published
together with
FCT in the Springer
Verlag series Lecture Notes in Computer Science. The accepted papers from mathematics and operations research
will be published after the workshop in the Electronic Notes in Discrete
Mathematics.
In addition a subset of all papers will be invited after the workshop
for publication in a special issue.
IMPORTANT DATES - EXTENDED DEADLINE
Submissions: March 14, 2001 Notifications: April 11, 2001 Camera Ready (LNCS): May 7, 2001 Camera Ready (ENDM): September 24, 2001
PROGRAM COMMITTEE
Yossi Azar, Tel-Aviv University
Evripidis Bampis, University of Evry, co-chair
Michael Bender, SUNY at Stony Brook
Thomas Erlebach, ETH-Zurich
Wenceslas Fernandez De La Vega, LRI, Orsay
Wen-Lian Hsu, Academia Sinica
Klaus Jansen, University of Kiel, co-chair
Elias Koutsoupias, University of Athens and UCLA
Jan Kratochvil, Charles University, Prague
Seffi Naor, Technion Haifa
Takao Nishizeki, Tohoku University
Ingo Schiermeyer, TU Freiberg
Sergey Sevastianov, Novosibirsk
Martin Skutella, TU Berlin