Pages that link to "Item:Q1987245"

The following pages link to Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245):

Displaying 1 item.

• Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)