Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Improving the smoothed complexity of FLIP for max cut problems."

Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran (2019)

> Home

Details and statistics

DOI: 10.1137/1.9781611975482.55

access: open

type: Conference or Workshop Paper

metadata version: 2022-11-29

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/BibakCC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BibakCC19
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the smoothed complexity of FLIP for max cut problems. SODA 2019: 897-916

a service of

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.