"On the Parameterized Complexity of the Connected Flow and Many Visits TSP ..."

Isja Mannens et al. (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-86838-3_5

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/MannensNSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/MannensNSS21
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi:
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG 2021: 52-79

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.