Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/B99805zbMath1106.68434OpenAlexW4301133941MaRDI QIDQ5313049

Petr Kolman, Jiří Sgall, Marek Chrobak

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (15)

Mathematical programming strategies for solving the minimum common string partition problem ⋮ Greedy Conjecture for Strings of Length 4 ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ An approximation algorithm for genome sorting by reversals to recover all adjacencies ⋮ Minimum common string partition revisited ⋮ Solving the maximum duo-preservation string mapping problem with linear programming ⋮ Edit distance with move operations ⋮ Edit distance with block deletions ⋮ Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem ⋮ Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time ⋮ Unnamed Item ⋮ The greedy algorithm for edit distance with moves ⋮ A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques