On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
Marx, Dániel and Pilipczuk, M and Pilipczuk, M (2018) On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, New York (N.Y.), pp. 474-484. ISBN 9781538642306 10.1109/FOCS.2018.00052
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Marx_474_30351087_z.pdf Restricted to Registered users only Download (309kB) | Request a copy |
| 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: | 08 Jan 2019 16:24 |
| Last Modified: | 08 Jan 2019 16:24 |
| URI: | https://eprints.sztaki.hu/id/eprint/9564 |
 |
Update Item |
