Computing all-pairs shortest paths by leveraging low treewidth

LR Planken; MM de Weerdt; RPJ van der Krogt

Computing all-pairs shortest paths by leveraging low treewidth

LR Planken, MM de Weerdt, RPJ van der Krogt

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

10 Citations (Scopus)

Original language	English
Title of host publication	Proceedings 21st International Conference on Automated Planning and Scheduling
Editors	M Helmert, S Edelkamp
Place of Publication	Palo Alto, CA, USA
Publisher	American Association for Artificial Intelligence (AAAI)
Pages	170-177
Number of pages	8
ISBN (Print)	978-1-57735-503-8
Publication status	Published - 2011
Event	ICAPS 2011, Freiburg, Germany - Palo Alto, CA, USA Duration: 11 Jun 2011 → 16 Jun 2011

Publication series

Name
Publisher	AAAI Press

Conference

Conference	ICAPS 2011, Freiburg, Germany
Period	11/06/11 → 16/06/11

Keywords

Conf.proc. > 3 pag

Cite this

@inproceedings{99e09c1138fc49d69754c6d21ab762f7,

title = "Computing all-pairs shortest paths by leveraging low treewidth",

keywords = "Conf.proc. > 3 pag",

author = "LR Planken and \{de Weerdt\}, MM and \{van der Krogt\}, RPJ",

year = "2011",

language = "English",

isbn = "978-1-57735-503-8",

publisher = "American Association for Artificial Intelligence (AAAI)",

pages = "170--177",

editor = "M Helmert and S Edelkamp",

booktitle = "Proceedings 21st International Conference on Automated Planning and Scheduling",

address = "United States",

note = "ICAPS 2011, Freiburg, Germany ; Conference date: 11-06-2011 Through 16-06-2011",

}

Computing all-pairs shortest paths by leveraging low treewidth. / Planken, LR ; de Weerdt, MM; van der Krogt, RPJ.
Proceedings 21st International Conference on Automated Planning and Scheduling. ed. / M Helmert; S Edelkamp. Palo Alto, CA, USA: American Association for Artificial Intelligence (AAAI), 2011. p. 170-177.

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Computing all-pairs shortest paths by leveraging low treewidth

AU - Planken, LR

AU - de Weerdt, MM

AU - van der Krogt, RPJ

PY - 2011

Y1 - 2011

KW - Conf.proc. > 3 pag

UR - http://www.st.ewi.tudelft.nl/~planken/papers/planken-icaps11.pdf

UR - https://www.scopus.com/pages/publications/80054832508

M3 - Conference contribution

SN - 978-1-57735-503-8

SP - 170

EP - 177

BT - Proceedings 21st International Conference on Automated Planning and Scheduling

A2 - Helmert, M

A2 - Edelkamp, S

PB - American Association for Artificial Intelligence (AAAI)

CY - Palo Alto, CA, USA

T2 - ICAPS 2011, Freiburg, Germany

Y2 - 11 June 2011 through 16 June 2011

ER -

Computing all-pairs shortest paths by leveraging low treewidth

Publication series

Conference

Keywords

Other files and links

Network instance HTN, edition 2

Network instance Job shop, edition 2

Network instance Scale-free; constant vertex count, varying density, edition 2

Cite this

Computing all-pairs shortest paths by leveraging low treewidth

Publication series

Conference

Keywords

Other files and links

Datasets

Network instance HTN, edition 2

Network instance Job shop, edition 2

Network instance Scale-free; constant vertex count, varying density, edition 2

Cite this