Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

2 well known approximations (MAX 3DM) #72

Open
ilyakava opened this issue Aug 30, 2017 · 0 comments
Open

2 well known approximations (MAX 3DM) #72

ilyakava opened this issue Aug 30, 2017 · 0 comments

Comments

@ilyakava
Copy link
Owner

When phrased as the optimization problem here and here, there are 2 well know approaches. The first gets a round of sups that is within 1/3 of the best possible round, the second gets a round of sups that is within 2/3 + ε of the best possible round.

screenshot from 2017-08-30 12-22-26

from Maximum bounded 3-dimensional matching is MAX SNP-complete
Viggo Kann
Royal Institute of Technology, Stockholm

screenshot from 2017-08-30 12-23-51

from here
@ilyakava ilyakava changed the title 2 well known approximations 2 well known approximations (MAX 3DM) Aug 30, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ilyakava