Skip to content

Apply local search to Split algorithms #92

@AFellner

Description

@AFellner

A series of sequential applications of the Split algorithm can have single applications with negative compression, while the whole series shows positive compressions.
Therefore discarding steps with negative compression by default can lead to getting stuck in a local optima.
Exploring all possible application orders is obviously not feasible for reasons of performance. Adapting local search algorithms to this problem could increase the achieved compression ratio.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions