"Approximability and Inapproximability for Maximum k-Edge-Colored ..."

Yousef M. Alhamdan, Alexander V. Kononov (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-19955-5_1

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/AlhamdanK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/AlhamdanK19
Yousef M. Alhamdan, Alexander V. Kononov:
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. CSR 2019: 1-12

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.