Settling the Approximability of Submodular Facility Location
2 versions
MN
Meike Neuwohner
cs.DScs.DMmath.COcs.CGmath.OCcs.GTHereditary set packingLocal searchmath.ACMaximum Leaf Spanning Arborescence problem
On Valency
published · living versionsPreprints & journals
17 papers in the corpus · 2021–2026Boxicity and Threshold Dimension of Zero Divisor Graphs
0 citations
Cosigning Crossing Families and Outer-Planar Gadgets
0 citations
Approximation Schemes for Planar Graph Connectivity Problems
0 citations
A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
0 citations
A 4 3 -approximation for the maximum leaf spanning arborescence problem in DAGs.
0 citations
Strong orientation of a connected graph for a crossing family
1 citation
Characterizing unimodular laminar hypergraphs via forbidden subhypergraphs
0 citations
A -Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
0 citations
Faster Dynamic Auctions via Polymatroid Sum
2 citations
Improved guarantees for the a priori TSP
0 citations
The --Set Packing problem and a -approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
0 citations
The Pareto cover problem
0 citations
Passing the Limits of Pure Local Search for Weighted -Set Packing
14 citations
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
14 citations
The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
0 citations
Reducing Moser's Square Packing Problem to a Bounded Number of Squares
0 citations
A Fast Optimal Double Row Legalization Algorithm
4 citations
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.