default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Optimal LP Rounding and Linear-Time Approximation Algorithms for ..."

Nate Veldt (2023)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2023-08-28

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icml/Veldt23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/Veldt23
Nate Veldt:
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. ICML 2023: 34924-34951

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.