Improved first player strategy for the zero-sum sequential uncrossing game

DOI10.15826/umj.2024.1.012MaRDI QIDQ6643644

Ksenia Rizhenko

Publication date: 26 November 2024

Published in: Ural mathematical journal (Search for Journal in Brave)

zbMATH Keywords

laminar familyuncrossing gameefficient winning strategy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Covering a laminar family by leaf to leaf links
• How to tidy up a symmetric set-system by use of uncrossing operations
• LP-relaxations for tree augmentation
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
• FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
• Approximation algorithms with constant factors for a series of asymmetric routing problems
• Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation

This page was built for publication: Improved first player strategy for the zero-sum sequential uncrossing game