The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W817371852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum weight cycle covers in directed graphs with weights zero and one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotations of Periodic Strings and Short Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acquisition of 2D shape models from scenes with overlapping objects using string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy travelling salesman's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Greedy Superstring Conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:23, 12 July 2024

scientific article
Language Label Description Also known as
English
The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
scientific article

    Statements

    The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (English)
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    approximation algorithm
    0 references
    shortest superstring problem
    0 references
    stringology
    0 references
    data compression
    0 references
    assembly
    0 references
    greedy conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references