Approximation Theory in Combinatorial Optimization. Application to the generalized minimum spanning tree problem

Walter Kern, P.C. Pop, Georg J. Still

Research output: Contribution to journal › Article › Academic › peer-review

Original language	Undefined
Pages (from-to)	93-102
Number of pages	9
Journal	Revue d'analyse numérique et de la théorie de l'approximation
Volume	34
Publication status	Published - 2005

Cite this

@article{0497eb55df8a4dd580eb67d3bbca2e2d,

title = "Approximation Theory in Combinatorial Optimization. Application to the generalized minimum spanning tree problem",

keywords = "METIS-225711",

author = "Walter Kern and P.C. Pop and Still, {Georg J.}",

year = "2005",

language = "Undefined",

volume = "34",

pages = "93--102",

journal = "Revue d'analyse num{\'e}rique et de la th{\'e}orie de l'approximation",

issn = "1222-9024",

publisher = "Editura Academiei Romane",

}

TY - JOUR

T1 - Approximation Theory in Combinatorial Optimization. Application to the generalized minimum spanning tree problem

AU - Kern, Walter

AU - Pop, P.C.

AU - Still, Georg J.

PY - 2005

Y1 - 2005

KW - METIS-225711

M3 - Article

VL - 34

SP - 93

EP - 102

JO - Revue d'analyse numérique et de la théorie de l'approximation

JF - Revue d'analyse numérique et de la théorie de l'approximation

SN - 1222-9024

ER -