The Parameterized Hardness of the k-Center Problem in Transportation Networks
Feldmann, A E and Marx, Dániel (2020) The Parameterized Hardness of the k-Center Problem in Transportation Networks. ALGORITHMICA, 82 (7). pp. 1989-2005. ISSN 0178-4617 10.1007/s00453-020-00683-w
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Feldmann_1989_31391130_z.pdf Restricted to Registered users only Download (3MB) |
Official URL: http://doi.org/10.1007/s00453-020-00683-w
| Item Type: | Article |
|---|---|
| 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: | 05 Dec 2020 08:57 |
| Last Modified: | 05 Dec 2020 08:57 |
| URI: | https://eprints.sztaki.hu/id/eprint/9986 |
 |
Update Item |
