"On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and ..."

Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin (2016)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2023-03-10

- view
  - electronic edition @ ceur-ws.org (open access)
- export record
  dblp key:
  - conf/door/EremeevKP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/door/EremeevKP16
Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin:
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. DOOR (Supplement) 2016: 526-535

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.