Skip to content

2 well known approximations (MAX 3DM) #72

@ilyakava

Description

@ilyakava

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions