Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial ..."

Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-41913-4_15

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ola/DupinNT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ola/DupinNT20
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi:
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time. OLA 2020: 179-191

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.