"On the approximability of clique and related maximization problems."

Aravind Srinivasan (2003)

> Home

Details and statistics

DOI: 10.1016/S0022-0000(03)00110-7

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Srinivasan03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Srinivasan03
Aravind Srinivasan:
On the approximability of clique and related maximization problems. J. Comput. Syst. Sci. 67(3): 633-651 (2003)

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.