Imagen de Portada

On the Complexity of Minimising the Moving Distance for Dispersing Objects

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Honorato-Droguett, Nicolás, Kurita, Kazuhiro, Hanaka, Tesshu, Ono, Hirotaka
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2023)

On the Complexity of Secluded Path Problems
por: Hanaka, Tesshu, et al.
Publicado: (2026)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
por: Komoto, Kenta, et al.
Publicado: (2026)

An improved spectral lower bound of treewidth
por: Gima, Tatsuya, et al.
Publicado: (2024)

Structural Parameterizations of Vertex Integrity
por: Gima, Tatsuya, et al.
Publicado: (2023)

Structural Parameters for Steiner Orientation
por: Hanaka, Tesshu, et al.
Publicado: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2025)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2025)

Parameterized Vertex Integrity Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
por: Hanaka, Tesshu, et al.
Publicado: (2024)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
por: Kurita, Kazuhiro, et al.
Publicado: (2025)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

Hedonic Seat Arrangement Problems
por: Bodlaender, Hans L., et al.
Publicado: (2020)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
por: Kobayashi, Yasuaki, et al.
Publicado: (2020)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
por: Conte, Alessio, et al.
Publicado: (2024)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)

Sequentially Swapping Tokens: Further on Graph Classes
por: Kiya, Hironori, et al.
Publicado: (2022)

Dichotomies for Tree Minor Containment with Structural Parameters
por: Gima, Tatsuya, et al.
Publicado: (2023)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

Computing diverse pair of solutions for tractable SAT
por: Gima, Tatsuya, et al.
Publicado: (2024)

Broadcasting under Structural Restrictions
por: Egami, Yudai, et al.
Publicado: (2025)

Online Coloring for Graphs of Large Odd Girth
por: Yoneda, Hirotaka, et al.
Publicado: (2026)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
por: Moretti, Simone, et al.
Publicado: (2022)

Graph Partitioning With Limited Moves
por: Behbahani, Majid, et al.
Publicado: (2024)

Optimal-Time Move Structure Construction
por: Brown, Nathaniel K., et al.
Publicado: (2026)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
por: Kociumaka, Tomasz, et al.
Publicado: (2025)

Hamming Distance Oracle
por: Boneh, Itai, et al.
Publicado: (2024)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
por: Das, Debarati, et al.
Publicado: (2025)

On the Complexity of the Ordered Covering Problem in Distance Geometry
por: Souza, Michael, et al.
Publicado: (2025)

Many Flavors of Edit Distance
por: Bhattacharya, Sudatta, et al.
Publicado: (2024)

Distributed Distance Sensitivity Oracles
por: Manoharan, Vignesh, et al.
Publicado: (2024)

RLZ-r and LZ-End-r: Enhancing Move-r
por: Dinklage, Patrick, et al.
Publicado: (2025)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Chamfer Distance
por: Goranci, Gramoz, et al.
Publicado: (2025)

On Rotation Distance of Rank Bounded Trees
por: M., Anoop S. K., et al.
Publicado: (2023)

Max-Distance Sparsification for Diversification and Clustering
por: Kumabe, Soh
Publicado: (2024)