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

DOI10.15826/UMJ.2024.1.012MaRDI QIDQ6643644zbMATH OpenFDO

Authors Ksenia Rizhenko

Publication date 26 November 2024

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

Full work available at URL https://doi.org/10.15826/UMJ.2024.1.012

zbMATH Keywords

efficient winning strategylaminar familyuncrossing game

Mathematics Subject Classification ID

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

Recommendations

• On uncrossing games for skew-supermodular functions
• scientific article; zbMATH DE number 15085
• How to tidy up a symmetric set-system by use of uncrossing operations
• A winning strategy for hold that line
• scientific article; zbMATH DE number 3858883

Cites work

• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• An Improved Approximation Algorithm for The 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
• 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
• Covering a laminar family by leaf to leaf links
• FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
• How to tidy up a symmetric set-system by use of uncrossing operations
• LP-relaxations for tree augmentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643644)