Computing Euclidean Steiner trees over segments
Copyright policy )Computing Euclidean Steiner trees over segments
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Johannes Gutenberg University of Mainz Germany
- TU Darmstadt Germany
- Johannes Gutenberg-University Germany
ddc:004, ddc:510, Euclidean Steiner minimum tree, T57-57.97, Applied mathematics. Quantitative methods, structural theorem, 510 Mathematik, QA75.5-76.95, exact algorithm, Programming involving graphs or networks, 004 Informatik, Computational geometry, 004, 510, 510 Mathematics, Electronic computers. Computer science, 004 Data processing
ddc:004, ddc:510, Euclidean Steiner minimum tree, T57-57.97, Applied mathematics. Quantitative methods, structural theorem, 510 Mathematik, QA75.5-76.95, exact algorithm, Programming involving graphs or networks, 004 Informatik, Computational geometry, 004, 510, 510 Mathematics, Electronic computers. Computer science, 004 Data processing
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!