"The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?"

Fritz Bökler (2017)

Details and statistics

DOI: 10.1007/978-3-319-54157-0_6

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

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.