"On the Approximability of Maximum and Minimum Edge Clique Partition Problems."

Anders Dessmark et al. (2006)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-05-17

- view
  - electronic edition @ westernsydney.edu.au (open access)
- export record
  dblp key:
  - conf/cats/DessmarkJLLP06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cats/DessmarkJLLP06
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105

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.