<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Martin~Gruber | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/martin~gruber/</link><atom:link href="https://ac.tuwien.ac.at/team/martin~gruber/index.xml" rel="self" type="application/rss+xml"/><description>Martin~Gruber</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2009 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Martin~Gruber</title><link>https://ac.tuwien.ac.at/team/martin~gruber/</link></image><item><title>Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics</title><link>https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/</guid><description/></item></channel></rss>