Meike Neuwohner

According to our database, Meike Neuwohner authored at least 12 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The limits of local search for weighted k-set packing.

Meike Neuwohner

Math. Program., July, 2024

A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs.

Meike Neuwohner

CoRR, 2024

A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs.

Meike Neuwohner

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

A Fast Optimal Double-row Legalization Algorithm.

Stefan Hougardy, Meike Neuwohner, Ulrike Schorr

ACM Trans. Design Autom. Electr. Syst., September, 2023

The 2-3-Set Packing problem and a 3/4-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags.

Meike Neuwohner

CoRR, 2023

Passing the Limits of Pure Local Search for Weighted <i>k</i>-Set Packing.

Meike Neuwohner

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Guarantees for the a Priori TSP.

Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.

Meike Neuwohner

CoRR, 2022

The Pareto Cover Problem.

Bento Natura, Meike Neuwohner, Stefan Weltge

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.

Meike Neuwohner

CoRR, 2021

Reducing Moser's Square Packing Problem to a Bounded Number of Squares.

Meike Neuwohner

CoRR, 2021

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.

Meike Neuwohner

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021