Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Althaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash

dblp
dblp
dblp



Editor(s):

Jansen, Klaus
Margraf, Marian
Mastrolli, Monaldo
Rolim, José D. P.

dblp
dblp
dblp
dblp

Not MPII Editor(s):

Jansen, Klaus
Margraf, Marian
Mastrolli, Monaldo
Rolim, José D. P.

BibTeX cite key*:

AlPoVa2003-lpimprove

Title, Booktitle

Title*:

Improving Linear Programming Approaches for the Steiner Tree Problem

Booktitle*:

Experimental and efficient algorithms : Second International Workshop, WEA 2003

Event, URLs

URL of the conference:

http://www.idsia.ch/wea2003/

URL for downloading the paper:


Event Address*:

Ascona, Switzerland

Language:

English

Event Date*
(no longer used):

May, 26 - May, 28

Organization:


Event Start Date:

26 May 2003

Event End Date:

28 May 2003

Publisher

Name*:

Springer

URL:

http://www.springer.de/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

2647

Number:


Month:


Pages:

1-14

Year*:

2003

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©

Note:

Pages are not yet known

(LaTeX) Abstract:

We present two theoretically interesting and empirically successful
techniques for improving the linear programming approaches, namely
graph transformation and local cuts, in the context of the
Steiner problem. We show the impact of these techniques on the
solution of the largest benchmark instances ever solved.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{AlPoVa2003-lpimprove,
AUTHOR = {Althaus, Ernst and Polzin, Tobias and Vahdati Daneshmand, Siavash},
EDITOR = {Jansen, Klaus and Margraf, Marian and Mastrolli, Monaldo and Rolim, Jos{\'e} D. P.},
TITLE = {Improving Linear Programming Approaches for the {Steiner} Tree Problem},
BOOKTITLE = {Experimental and efficient algorithms : Second International Workshop, WEA 2003},
PUBLISHER = {Springer},
YEAR = {2003},
VOLUME = {2647},
PAGES = {1--14},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Ascona, Switzerland},
}


Entry last modified by Sabine Krott, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Tobias Polzin
Created
04/16/2003 05:10:31 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Sabine Krott
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
17.06.2004 10:28:12
15.06.2004 15:27:31
15.06.2004 15:25:46
11.06.2004 17:11:35
04/16/2003 05:10:31 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section