Constant-level greedy triangulations approximate the MWT well

Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yinfeng Xu

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)361-369
JournalJournal of combinatorial optimization
Volume2
Publication statusPublished - 1998

Treatment code (Nähere Zuordnung)

  • Theoretical

Cite this

Constant-level greedy triangulations approximate the MWT well. / Aichholzer, Oswin; Aurenhammer, Franz; Rote, Günter; Xu, Yinfeng.

In: Journal of combinatorial optimization, Vol. 2, 1998, p. 361-369.

Research output: Contribution to journalArticleResearchpeer-review

@article{c2e899ca5be843d09ec0a75872055880,
title = "Constant-level greedy triangulations approximate the MWT well",
author = "Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yinfeng Xu",
note = "SFB-Report F003-050, TU Graz, Austria, 1995",
year = "1998",
language = "English",
volume = "2",
pages = "361--369",
journal = "Journal of combinatorial optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Constant-level greedy triangulations approximate the MWT well

AU - Aichholzer, Oswin

AU - Aurenhammer, Franz

AU - Rote, Günter

AU - Xu, Yinfeng

N1 - SFB-Report F003-050, TU Graz, Austria, 1995

PY - 1998

Y1 - 1998

M3 - Article

VL - 2

SP - 361

EP - 369

JO - Journal of combinatorial optimization

JF - Journal of combinatorial optimization

SN - 1382-6905

ER -