Approximability of the minimum-weight k-size cycle cover problem

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)
Original languageEnglish
Pages (from-to)65-82
Number of pages18
JournalJournal of Global Optimization
Issue number1
Publication statusPublished - 1 Sep 2016


  • Cycle cover problem (CCP)
  • NP-hard problem
  • Polynomial-time approximation scheme (PTAS)
  • Traveling salesman problem (TSP)

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

WoS ResearchAreas Categories

  • Operations Research & Management Science
  • Mathematics, Applied


Dive into the research topics of 'Approximability of the minimum-weight k-size cycle cover problem'. Together they form a unique fingerprint.

Cite this