Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem ..."

Per Olov Lindberg, Gholamreza Razmara (2004)

> Home

Details and statistics

DOI: 10.1007/3-540-27679-3_45

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/or/LindbergR04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/or/LindbergR04
Per Olov Lindberg, Gholamreza Razmara:
The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing. OR 2004: 360-367

a service of

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.