"Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A ..."

Shuyang Ling, Thomas Strohmer (2020)

> Home

Details and statistics

DOI: 10.1007/S10208-019-09421-3

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/focm/LingS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/focm/LingS20
Shuyang Ling, Thomas Strohmer:
Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering. Found. Comput. Math. 20(3): 367-421 (2020)

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.