The following pages link to Joachim Spoerhase (Q521819):
Displayed 44 items.
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- On minimum generalized Manhattan connections (Q832842) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- Item:Q521819 (redirect page) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- 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 (Q976129) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- PTAS for Steiner tree on map graphs (Q2081594) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
- Consistent simplification of polyline tree bundles (Q2695291) (← links)
- Approximating Spanning Trees with Few Branches (Q2848911) (← links)
- Approximating the Generalized Minimum Manhattan Network Problem (Q2872136) (← links)
- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs (Q2896380) (← links)
- Improved Approximation Algorithms for Box Contact Representations (Q2921396) (← links)
- On Monotone Drawings of Trees (Q2936957) (← links)
- (Q2954999) (← links)
- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems (Q3060754) (← links)
- Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← links)
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification (Q3452792) (← links)
- Colored Non-crossing Euclidean Steiner Forest (Q3459881) (← links)
- (Q4606313) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)
- (Q5091054) (← links)
- (Q5091245) (← links)
- Constant-factor approximation for ordered k-median (Q5230325) (← links)
- Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems (Q5362990) (← links)
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles (Q5891595) (← links)
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles (Q5895518) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5916087) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
- (Q6059203) (← links)
- Mind the gap: edge facility location problems in theory and practice (Q6132548) (← links)
- Coloring mixed and directional interval graphs (Q6172218) (← links)
- Hypergraph Representation via Axis-Aligned Point-Subspace Cover (Q6384033) (← links)