Solving a ``hard'' problem to approximate an ``easy'' one: heuristics for maximum matchings and maximum traveling salesman problems (Q4801176)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1893556
Language Label Description Also known as
default for all languages
No label defined
    English
    Solving a ``hard'' problem to approximate an ``easy'' one: heuristics for maximum matchings and maximum traveling salesman problems
    scientific article; zbMATH DE number 1893556

      Statements

      Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems (English)
      0 references
      Solving a ``hard'' problem to approximate an ``easy'' one: heuristics for maximum matchings and maximum traveling salesman problems (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      7 April 2003
      0 references

      Identifiers

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