JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for ORNET Archives


ORNET Archives

ORNET Archives


ORNET@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

ORNET Home

ORNET Home

ORNET  2000

ORNET 2000

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Final Call for Papers, APPROX 2000

From:

Klaus Jansen <[log in to unmask]>

Reply-To:

Klaus Jansen <[log in to unmask]>

Date:

Sat, 25 Mar 2000 16:15:21 +0100 (MET)

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (158 lines)



                            Final Call for Papers

                                APPROX 2000

                        3rd International Workshop on

      Approximation Algorithms for Combinatorial Optimization Problems

                             6 - 8 September 2000 

                    Max-Planck-Institute for Computer Science
                       
                             Saarbruecken, Germany

                 http://www.mpi-sb.mpg.de/~conf2000/approx2000/


                           

SCOPE: 
The workshop on approximation algorithms for combinatorial optimization
problems focuses on algorithmic and complexity aspects arising in the
development of efficient approximate solutions to computationally difficult
problems. It aims, in particular, at fostering the cooperation among
algorithmic and complexity researchers of the field. The workshop, to be
held at the Max-Planck-Institut fuer Informatik Saarbruecken, Germany,
on September 6 - 8, 2000, co-locates with ESA 2000 and WAE 2000. 


TOPICS:
Papers are solicited in all research areas related to approximation, 
including, but not limited to:

* design and analysis of approximation algorithms
* inapproximability results
* on-line problems
* randomization techniques
* average-case analysis
* approximation classes
* scheduling problems
* routing and flow problems
* coloring and partitioning
* cuts and connectivity 
* packing and covering
* geometric problem
* network design
* various applications


INVITED SPEAKERS
Sanjeev Arora (Princeton University)
Dorit Hochbaum (UC Berkeley)
Rolf Moehring (TU Berlin)


PUBLICATION:
Proceedings will be published in the Springer-Verlag series Lecture Notes 
in Computer Science. Previous proceedings of APPROX 1998 in Aalborg and 
APPROX 1999 in Berkeley appeared as LNCS 1444 and LNCS 1671. 

A subset of the selected papers will be invited for publication in a 
special issue of Algorithmica.


SUBMISSION GUIDELINES:
Electronic submissions are solicited. A detailed description of the 
electronic submission process is available at

         http://www.mpi-sb.mpg.de/~conf2000/approx2000/subm.html

The postscript file must be received by 11:59pm (PDT) of April 3rd for 
your submission to be considered.
                       
In extreme cases, contributions may be submitted by sending 6 hard
copies to:

                Klaus Jansen, APPROX 2000
                Institut fuer Informatik und praktische Mathematik
                Christian-Albrechts-Universitaet zu Kiel
                Olshausenstr. 40
                D-24098 Kiel, Germany

Your hard copy submission must be received by April 3rd (or postmarked
March 27th or earlier and sent by airmail) in order to be considered.

Submissions should consists of an extended abstract describing original 
research in no more than 10 pages; an optional appendix, with more details 
to be read/consulted at the discretion of the program committee. The 
submission should give the author's email address and FAX number if available.

Simultaneous submission to other conferences with published proceedings is 
not allowed except to ESA 2000 with the understanding that if the paper is
accepted to ESA 2000 then the paper will have to be withdrawn from APPROX 
2000 immediately by sending an email message to [log in to unmask]
Accepted contributed papers will receive an allotment of 12 pages in the
proceedings.


SPECIAL:
Along with contributed papers, we will schedule several special sessions 
consisting of SURVEY TALKS and RECENT RESULTS. You are invited to submit a 
short proposal (a short abstract with at most 3 pages) until May 1.
We particularly encourage submissions (for short abstracts) that cover 
recent results that appeared or are soon to appear in other conferences
or in journals. Accepted short abstracts will be allotted three pages in 
the proceeding.

It is expected that all accepted papers will be presented at the workshop. 


IMPORTANT DATES:

Submissions:                     April 3, 2000
Submissions (short abstracts):   May 1, 2000
Notifications:                   May 29, 2000
Camera Ready:                    June 29, 2000
Workshop:                        September 6-8, 2000


WORKSHOP CHAIR:

Klaus Jansen,  University of Kiel


PROGRAM CHAIR:

Samir Khuller, University of Maryland


PROGRAM COMMITTEE:

Klaus Jansen, University of Kiel, 
Tao Jiang, University of California, Riverside
Sanjeev Khanna, University of Pennsylvania
Samir Khuller, University of Maryland, 
Jon Kleinberg, Cornell University
Stefano Leonardi, Universita di Roma
Rajeev Motwani,	Stanford University
Baruch Schieber, IBM Research
Martin Skutella, Technical University Berlin
Eva Tardos, Cornell University / UC Berkeley
Gerhard Woeginger, Technical University Graz
Neal Young, Dartmouth College


For further informations see http://www.mpi-sb.mpg.de/~conf2000/approx2000/
or please contact Klaus Jansen ([log in to unmask]) and Samir Khuller
([log in to unmask]). 






%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager