The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
Feldmann, Andreas Emil and Marx, Dániel (2016) The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs) (55). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 27:1-27:14. ISBN 978-3-95977-013-2 10.4230/LIPIcs.ICALP.2016.27
|
Text
Feldmann_27_3164326_ny.pdf Download (534kB) | Preview |
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 14 Feb 2018 07:35 |
| Last Modified: | 21 Jul 2019 13:45 |
| URI: | https://eprints.sztaki.hu/id/eprint/9354 |
 |
Update Item |
