The following pages link to Andreas Emil Feldmann (Q344950):
Displaying 31 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- A tight lower bound for Steiner orientation (Q1625142) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- On the Parameterized Complexity of Computing Graph Bisections (Q2864292) (← links)
- (Q2904753) (← links)
- Fast Balanced Partitioning Is Hard Even on Grids and Trees (Q2912736) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- (Q2969617) (← links)
- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids (Q3066140) (← links)
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs (Q3092224) (← links)
- Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772) (← links)
- (Q3304124) (← links)
- (Q4598163) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- (Q5874516) (← links)
- FPT Inapproximability of Directed Cut and Connectivity Problems (Q5875540) (← links)
- (Q6059176) (← links)
- (Q6068263) (← links)
- (Q6192486) (← links)
