Bandopadhyay, S., Banerjee, S., Majumdar, D. et al. (1 more author) (Accepted: 2024) Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. In: Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024). 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), 06-08 Dec 2024, Beijing, China. Lecture Notes in Computer Science . Springer (In Press)
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of a conference paper accepted for publication in Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), made available under the terms of the Creative Commons Attribution License (CC BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 Oct 2024 14:17 |
Last Modified: | 28 Feb 2025 14:27 |
Status: | In Press |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:218508 |