Joachim Spoerhase

Available identifiers

zbMath Open spoerhase.joachimWikidataQ102380331 ScholiaQ102380331MaRDI QIDQ521819

List of research outcomes

Publication	Date of Publication	Type
Simplification of Polyline Bundles	2023-11-02	Paper
Mind the gap: edge facility location problems in theory and practice	2023-08-17	Paper
Coloring mixed and directional interval graphs	2023-08-16	Paper
Consistent simplification of polyline tree bundles	2023-03-30	Paper
PTAS for Steiner tree on map graphs	2022-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q5091054	2022-07-21	Paper
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints	2022-07-21	Paper
Hypergraph representation via axis-aligned point-subspace cover	2022-07-13	Paper
On minimum generalized Manhattan connections	2022-03-25	Paper
Hypergraph Representation via Axis-Aligned Point-Subspace Cover	2021-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q5009574	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002791	2021-07-28	Paper
A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs	2021-04-21	Paper
Approximating node-weighted \(k\)-MST on planar graphs	2020-06-02	Paper
Constant-factor approximation for ordered k-median	2019-08-22	Paper
Approximating node-weighted \(k\)-MST on planar graphs	2019-01-15	Paper
New algorithms for maximum disjoint paths based on tree-likeness	2018-09-28	Paper
An improved approximation algorithm for knapsack median using sparsification	2018-05-23	Paper
Approximating the generalized minimum Manhattan network problem	2018-05-23	Paper
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness	2018-03-02	Paper
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems	2017-10-05	Paper
Improved approximation algorithms for box contact representations	2017-04-12	Paper
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees	2017-01-24	Paper
Colored Non-crossing Euclidean Steiner Forest	2016-01-11	Paper
An Improved Approximation Algorithm for Knapsack Median Using Sparsification	2015-11-19	Paper
Better approximation algorithms for the maximum internal spanning tree problem	2015-06-25	Paper
Approximating spanning trees with few branches	2015-05-12	Paper
Approximating minimum Manhattan networks in higher dimensions	2015-03-02	Paper
On Monotone Drawings of Trees	2015-01-07	Paper
Improved Approximation Algorithms for Box Contact Representations	2014-10-08	Paper
Approximating the Generalized Minimum Manhattan Network Problem	2014-01-14	Paper
Approximating Spanning Trees with Few Branches	2013-09-13	Paper
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs	2012-07-16	Paper
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles	2012-06-08	Paper
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles	2012-03-09	Paper
Approximating minimum Manhattan networks in higher dimensions	2011-09-16	Paper
Maximum Betweenness Centrality: Approximability and Tractable Cases	2011-02-20	Paper
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems	2010-12-09	Paper
An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees	2010-06-16	Paper
Relaxed voting and competitive location under monotonous gain functions on trees	2010-05-05	Paper
\((r,p)\)-centroid problems on paths and trees	2009-11-06	Paper
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem	2009-10-20	Paper
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree	2009-06-24	Paper
Multiple voting location and single voting location on trees	2007-04-19	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Joachim Spoerhase