• 1 Introduction
    • 1.1 Related Work
    • 1.2 Contributions
    • 1.3 Hardness of exactly solving MINETREX.
    • 1.4 Open Problems
  • 2 Greedy Approximation
  • 3 Hardness of Approximation
  • 4 Ultrasuccinct Unlabelled Graphs
    • 4.1 Preliminaries
    • 4.2 Adjacency string representation
    • 4.3 TREX Data Structure
    • 4.4 Operations
    • 4.5 Space and time analysis
  • 5 Twin Removal
    • 5.1 Operations with twin removal
    • 5.2 Space and time analysis
  • 6 Good graphs classes
  • References
  • Appendix
    • A Hardness of Hitting Set
    • B A Tree is Never Worse Than a Forest
    • C Copy Model
      • C.1 The Random Copy Model
      • C.2 Properties
      • C.3 Entropy
      • C.4 TREX with twin removal is instance-optimal