Copertina

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhao, Jingyang, Xiao, Mingyu
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2024)

The APX-hardness of the Traveling Tournament Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

An Improved Approximation Algorithm for Metric Triangle Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2024)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
di: Zhao, Jingyang, et al.
Pubblicazione: (2022)

Improved Approximations for Dial-a-Ride Problems
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
di: Kumar, Mithilesh, et al.
Pubblicazione: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
di: Liu, Yuxi, et al.
Pubblicazione: (2023)

New Algorithms and Lower Bounds for Streaming Tournaments
di: Ghosh, Prantar, et al.
Pubblicazione: (2024)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
di: Xiong, Ziliang, et al.
Pubblicazione: (2024)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
di: Tian, Kangyi, et al.
Pubblicazione: (2026)

Efficient Kernelization Algorithm for Bipartite Graph Matching
di: Wu, Guang, et al.
Pubblicazione: (2024)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
di: Gupta, Sushmita, et al.
Pubblicazione: (2024)

New Algorithms for #2-SAT and #3-SAT
di: Peng, Junqiang, et al.
Pubblicazione: (2025)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
di: Soma, Tasuku, et al.
Pubblicazione: (2025)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
di: Zheng, Da Wei, et al.
Pubblicazione: (2023)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
di: Chen, Chi-Yeh
Pubblicazione: (2026)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
di: Liu, Yuxi, et al.
Pubblicazione: (2026)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
di: Kwok, Shawxing
Pubblicazione: (2025)

Dynamic Parameterized Feedback Problems in Tournaments
di: Zych-Pawlewicz, Anna, et al.
Pubblicazione: (2024)

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
di: Wang, Zhonghao, et al.
Pubblicazione: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
di: Chuzhoy, Julia, et al.
Pubblicazione: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
di: Hu, Hang, et al.
Pubblicazione: (2022)

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
di: Jain, Sanjay, et al.
Pubblicazione: (2026)

Approximation Algorithms for Fair Repetitive Scheduling
di: Hermelin, Danny, et al.
Pubblicazione: (2025)

Biclique Reconfiguration in Bipartite Graphs
di: Otachi, Yota, et al.
Pubblicazione: (2026)

An Empirical Study of Online Packet Scheduling Algorithms
di: Sakr, Nourhan, et al.
Pubblicazione: (2016)

A Refined Kernel for $d$-Hitting Set
di: Liu, Yuxi, et al.
Pubblicazione: (2025)

Linear Kernels for $l$-Exact Component Order Connectivity
di: Liu, Yuxi, et al.
Pubblicazione: (2026)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
di: Bai, Tian, et al.
Pubblicazione: (2022)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
di: Liu, Yuxi, et al.
Pubblicazione: (2024)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
di: Gupta, Sushmita, et al.
Pubblicazione: (2024)