Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313049
DOI10.1007/b99805zbMath1106.68434MaRDI 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25: Approximation algorithms
Related Items
Unnamed Item, Unnamed Item, Computational performance evaluation of two integer linear programming models for the minimum common string partition problem, Minimum common string partition revisited, Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time, The greedy algorithm for edit distance with moves, Edit distance with block deletions, A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem, An approximation algorithm for genome sorting by reversals to recover all adjacencies, Solving the maximum duo-preservation string mapping problem with linear programming, Edit distance with move operations, Mathematical programming strategies for solving the minimum common string partition problem, Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
