Imagen de Portada

Independent Set Reconfiguration Under Bounded-Hop Token

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hatano, Hiroki, Kitamura, Naoki, Izumi, Taisuke, Ito, Takehiro, Masuzawa, Toshimitsu
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms 68W01 General topics in the theory of algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
por: Harada, Kaito, et al.
Publicado: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
por: Anders, Markus, et al.
Publicado: (2024)

Algorithms Transcending the SAT-Symmetry Interface
por: Anders, Markus, et al.
Publicado: (2023)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
por: Rahat, Md Tanzeem, et al.
Publicado: (2025)

Random-Order Online Independent Set of Intervals and Hyperrectangles
por: Garg, Mohit, et al.
Publicado: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
por: Friggstad, Zachary, et al.
Publicado: (2018)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

Compact enumeration for scheduling one machine
por: Vakhania, Nodari
Publicado: (2021)

Building a Nest by an Automaton
por: Czyzowicz, Jurek, et al.
Publicado: (2019)

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
por: Ito, Takehiro, et al.
Publicado: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

On Distributed Colouring of Hyperbolic Random Graphs
por: Maus, Yannic, et al.
Publicado: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
por: Lynch, Nancy
Publicado: (2024)

On the Advice Complexity of Online Unit Clustering
por: Nagy-György, Judit
Publicado: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

The Telephone $k$-Multicast Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
por: Hung, Chia-Yang, et al.
Publicado: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
por: Bai, Miao, et al.
Publicado: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
por: Grobben, Kobe, et al.
Publicado: (2025)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
por: Nasre, Meghana, et al.
Publicado: (2023)

Notes on Randomized Algorithms
por: Aspnes, James
Publicado: (2020)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
por: Chiclana, Rafael, et al.
Publicado: (2025)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
por: AmaniHamedani, Alireza, et al.
Publicado: (2024)

Improved Approximation Algorithms for the Expanding Search Problem
por: Griesbach, Svenja M., et al.
Publicado: (2023)

Optimizing Exact String Matching via Statistical Anchoring
por: Garraoui, Omar
Publicado: (2025)

Incremental-Decremental Maximization
por: Disser, Yann, et al.
Publicado: (2025)

Strengths and Limitations of Greedy in Cup Games
por: Jasińska, Kalina, et al.
Publicado: (2026)

Quasi-optimal hierarchically semi-separable matrix approximation
por: Amsel, Noah, et al.
Publicado: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
por: Shigemizu, Mika, et al.
Publicado: (2018)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)