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

Anders Dessmark et al. (2007)

> Home

Details and statistics

DOI: 10.1142/S0129054107004656

access: closed

type: Journal Article

metadata version: 2022-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/DessmarkJLLP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/DessmarkJLLP07
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007)

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.