Approximating geometric coverage problems

T. Erlebach; E.J. Leeuwen, van

Approximating geometric coverage problems

T. Erlebach, E.J. Leeuwen, van

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08, San Francisco CA, USA, January 20-22, 2008)
Editors	S.T. Huang
Place of Publication	Philadelpha PA
Publisher	Society for Industrial and Applied Mathematics (SIAM)
Pages	1267-1276
Publication status	Published - 2008

Cite this

@inproceedings{69cecfd46126462f987d727a3b588c60,

title = "Approximating geometric coverage problems",

author = "T. Erlebach and {Leeuwen, van}, E.J.",

year = "2008",

language = "English",

pages = "1267--1276",

editor = "S.T. Huang",

booktitle = "Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08, San Francisco CA, USA, January 20-22, 2008)",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

address = "United States",

}

Approximating geometric coverage problems. / Erlebach, T.; Leeuwen, van, E.J.
Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08, San Francisco CA, USA, January 20-22, 2008). ed. / S.T. Huang. Philadelpha PA: Society for Industrial and Applied Mathematics (SIAM), 2008. p. 1267-1276.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Approximating geometric coverage problems

AU - Erlebach, T.

AU - Leeuwen, van, E.J.

PY - 2008

Y1 - 2008

UR - http://doi.acm.org/10.1145/1347082.1347220

M3 - Conference contribution

SP - 1267

EP - 1276

BT - Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08, San Francisco CA, USA, January 20-22, 2008)

A2 - Huang, S.T.

PB - Society for Industrial and Applied Mathematics (SIAM)

CY - Philadelpha PA

ER -

Approximating geometric coverage problems

Other files and links

Cite this