TY  - CONF

T1  - FPT inapproximability of directed cut and connectivity problems

JO  - Leibniz International Proceedings in Informatics, LIPIcs

PY  - 2019/12/01

AU  - Chitnis R

AU  - Feldmann AE

ED  - 

DO  - DOI: 10.4230/LIPIcs.IPEC.2019.8

SN  - 9783959771290

VL  - 148

Y2  - 2024/12/22

ER  -