Imagen de Portada

Dynamic Necklace Splitting

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Advani, Rishi, Asudeh, Abolfazl, Dehghankar, Mohsen, Sintos, Stavros
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms F.2.2; G.2.m
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
por: Neogi, Rian, et al.
Publicado: (2025)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
por: Nicosia, Gaia, et al.
Publicado: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
por: Ma, Will, et al.
Publicado: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
por: Chen, Yongyu
Publicado: (2023)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
por: Jacob, Ashwin, et al.
Publicado: (2026)

Better Approximation for Weighted $k$-Matroid Intersection
por: Singer, Neta, et al.
Publicado: (2024)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

Loop unrolling of UCA models: distance labeling
por: Soulignac, Francisco J, et al.
Publicado: (2022)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
por: Bredereck, Robert, et al.
Publicado: (2020)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
por: Livanos, Vasilis, et al.
Publicado: (2024)

Efficient Approximation of Fractional Hypertree Width
por: Korchemna, Viktoriia, et al.
Publicado: (2024)

A Decomposition Approach to the Weighted $k$-server Problem
por: Ayyadevara, Nikhil, et al.
Publicado: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
por: Elbassioni, Khaled
Publicado: (2025)

Fair Division Among Couples and Small Groups
por: Gölz, Paul, et al.
Publicado: (2025)

Flip-width: Cops and Robber on dense graphs
por: Toruńczyk, Szymon
Publicado: (2023)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

Computing parameters that generalize interval graphs using restricted modular partitions
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

Rotation distance using flows
por: Mathieu, Claire, et al.
Publicado: (2024)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)