Canadian Traveller Problems in Temporal Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Bellitto, Thomas, Cohen, Johanne, Escoffier, Bruno, Nguyen, Minh-Hang, Rabie, Mikael |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
por: Pashkovich, Kanstantsin, et al.
Publicado: (2026)
por: Pashkovich, Kanstantsin, et al.
Publicado: (2026)
Optimally Interpolating between Ex-Ante Fairness and Welfare
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)
The Average-Value Allocation Problem
por: Bhawalkar, Kshipra, et al.
Publicado: (2024)
por: Bhawalkar, Kshipra, et al.
Publicado: (2024)
Pandora's Problem with Combinatorial Cost
por: Berger, Ben, et al.
Publicado: (2023)
por: Berger, Ben, et al.
Publicado: (2023)
The Secretary Problem with Predicted Additive Gap
por: Braun, Alexander, et al.
Publicado: (2024)
por: Braun, Alexander, et al.
Publicado: (2024)
The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)
por: Elmalem, Noga Klein, et al.
Publicado: (2025)
An Algorithm-to-Contract Framework without Demand Queries
por: Doron-Arad, Ilan, et al.
Publicado: (2025)
por: Doron-Arad, Ilan, et al.
Publicado: (2025)
Static Pricing for Online Selection Problem and its Variants
por: Sun, Bo, et al.
Publicado: (2024)
por: Sun, Bo, et al.
Publicado: (2024)
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
por: Glitzner, Frederik, et al.
Publicado: (2024)
por: Glitzner, Frederik, et al.
Publicado: (2024)
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)
por: Segev, Danny, et al.
Publicado: (2020)
Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
por: Rubinstein, Aviad
Publicado: (2016)
por: Rubinstein, Aviad
Publicado: (2016)
Tractable Graph Structures in EFX Orientation
por: Blažej, Václav, et al.
Publicado: (2025)
por: Blažej, Václav, et al.
Publicado: (2025)
Non-Monotonicity in Fair Division of Graphs
por: Hosseini, Hadi, et al.
Publicado: (2025)
por: Hosseini, Hadi, et al.
Publicado: (2025)
Equitable Colorings of Vertex-Weighted Graphs
por: Barman, Siddharth, et al.
Publicado: (2026)
por: Barman, Siddharth, et al.
Publicado: (2026)
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
por: Constantinescu, Andrei, et al.
Publicado: (2023)
por: Constantinescu, Andrei, et al.
Publicado: (2023)
Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
por: Kawase, Sota, et al.
Publicado: (2024)
por: Kawase, Sota, et al.
Publicado: (2024)
Prophet and Secretary at the Same Time
por: Kehne, Gregory, et al.
Publicado: (2025)
por: Kehne, Gregory, et al.
Publicado: (2025)
Sample Complexity of Posted Pricing for a Single Item
por: Jin, Billy, et al.
Publicado: (2024)
por: Jin, Billy, et al.
Publicado: (2024)
Pandora's Box Problem With Time Constraints
por: Amanatidis, Georgios, et al.
Publicado: (2024)
por: Amanatidis, Georgios, et al.
Publicado: (2024)
Hedonic Seat Arrangement Problems
por: Bodlaender, Hans L., et al.
Publicado: (2020)
por: Bodlaender, Hans L., et al.
Publicado: (2020)
Nemesis, an Escape Game in Graphs
por: Bergé, Pierre, et al.
Publicado: (2026)
por: Bergé, Pierre, et al.
Publicado: (2026)
Matching with Nested and Bundled Pandora Boxes
por: Bowers, Robin, et al.
Publicado: (2024)
por: Bowers, Robin, et al.
Publicado: (2024)
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
por: Feng, Yuda, et al.
Publicado: (2024)
por: Feng, Yuda, et al.
Publicado: (2024)
Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)
por: Bhaskara, Aditya, et al.
Publicado: (2024)
Budget-feasible Egalitarian Allocation of Conflicting Jobs
por: Gupta, Sushmita, et al.
Publicado: (2024)
por: Gupta, Sushmita, et al.
Publicado: (2024)
Randomized Binary and Tree Search under Pressure
por: Caracci, Agustín, et al.
Publicado: (2024)
por: Caracci, Agustín, et al.
Publicado: (2024)
A Little Aggression Goes a Long Way
por: Krishnan, Jyothi, et al.
Publicado: (2024)
por: Krishnan, Jyothi, et al.
Publicado: (2024)
Online Matroid Embeddings
por: Cristi, Andrés, et al.
Publicado: (2024)
por: Cristi, Andrés, et al.
Publicado: (2024)
Optimal Stopping with Interdependent Values
por: Mauras, Simon, et al.
Publicado: (2024)
por: Mauras, Simon, et al.
Publicado: (2024)
When far is better: The Chamberlin-Courant approach to obnoxious committee selection
por: Gupta, Sushmita, et al.
Publicado: (2024)
por: Gupta, Sushmita, et al.
Publicado: (2024)
Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
por: Chen, Liyan, et al.
Publicado: (2024)
por: Chen, Liyan, et al.
Publicado: (2024)
Metric Distortion of Line-up Elections: The Right Person for the Right Job
por: Jerrett, Christopher, et al.
Publicado: (2024)
por: Jerrett, Christopher, et al.
Publicado: (2024)
Designing Exploration Contracts
por: Hoefer, Martin, et al.
Publicado: (2024)
por: Hoefer, Martin, et al.
Publicado: (2024)
Group Fairness and Multi-criteria Optimization in School Assignment
por: A., Santhini K., et al.
Publicado: (2024)
por: A., Santhini K., et al.
Publicado: (2024)
Lipschitz Continuous Allocations for Optimization Games
por: Kumabe, Soh, et al.
Publicado: (2024)
por: Kumabe, Soh, et al.
Publicado: (2024)
On Controlling Knockout Tournaments Without Perfect Information
por: Blažej, Václav, et al.
Publicado: (2024)
por: Blažej, Václav, et al.
Publicado: (2024)
Fairness and Efficiency in Online Class Matching
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2024)
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2024)
Online Matching Meets Sampling Without Replacement
por: Huang, Zhiyi, et al.
Publicado: (2024)
por: Huang, Zhiyi, et al.
Publicado: (2024)
Strategic Facility Location via Predictions
por: Chen, Qingyun, et al.
Publicado: (2024)
por: Chen, Qingyun, et al.
Publicado: (2024)
Prophet Secretary and Matching: the Significance of the Largest Item
por: Chen, Ziyun, et al.
Publicado: (2024)
por: Chen, Ziyun, et al.
Publicado: (2024)
Ejemplares similares
-
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
por: Pashkovich, Kanstantsin, et al.
Publicado: (2026) -
Optimally Interpolating between Ex-Ante Fairness and Welfare
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023) -
The Average-Value Allocation Problem
por: Bhawalkar, Kshipra, et al.
Publicado: (2024) -
Pandora's Problem with Combinatorial Cost
por: Berger, Ben, et al.
Publicado: (2023) -
The Secretary Problem with Predicted Additive Gap
por: Braun, Alexander, et al.
Publicado: (2024)