Balanced partition of minimum spanning trees Conference

Andersson, M, Gudmundsson, J, Levcopoulos, C et al. (2003). Balanced partition of minimum spanning trees . INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 13(4), 303-316. 10.1142/S0218195903001190

Open Access International Collaboration

cited authors

  • Andersson, M; Gudmundsson, J; Levcopoulos, C; Narasimhan, G

sustainable development goals

authors

date/time interval

  • April 1, 2002 -

publication date

  • August 1, 2003

webpage

published in

keywords

  • APPROXIMATION ALGORITHMS
  • Computer Science
  • Computer Science, Theory & Methods
  • Mathematics
  • Mathematics, Applied
  • Physical Sciences
  • Science & Technology
  • Technology
  • approximation algorithms
  • computational geometry

Location

  • AMSTERDAM, NETHERLANDS

Digital Object Identifier (DOI)

Conference

  • International Workshop on Computational Geometry and Applications

publisher

  • WORLD SCIENTIFIC PUBL CO PTE LTD

start page

  • 303

end page

  • 316

volume

  • 13

issue

  • 4