Imagen de Portada

An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Donne, Diego Delle, Marenco, Javier, Moreno, Eduardo
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
por: Lucci, Mauro, et al.
Publicado: (2026)

Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting
por: Díaz-Bañez, José-Miguel, et al.
Publicado: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
por: Petersen, Bjørn, et al.
Publicado: (2025)

Excluding a rectangular grid
por: Rambaud, Clément
Publicado: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
por: Haslinger, Xenia, et al.
Publicado: (2025)

A 4-approximation algorithm for min max correlation clustering
por: Heidrich, Holger, et al.
Publicado: (2023)

On scheduling coupled tasks with exact delays to minimize maximum lateness
por: Kubiak, Wiesław
Publicado: (2026)

Creation of fixed points in block-parallel Boolean automata networks
por: Perrot, Kévin, et al.
Publicado: (2025)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
por: Perrotin, Pacôme, et al.
Publicado: (2024)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
por: Galanis, Andreas, et al.
Publicado: (2023)

A note on the exact partition polytope of Frieze and Teng
por: Narayanan, Krishna, et al.
Publicado: (2026)

The exact value of $c_1(K_{2,n})$
por: Mori, Hiroaki
Publicado: (2026)

Filling some gaps on the edge coloring problem of split graphs
por: Couto, Fernanda, et al.
Publicado: (2024)

An orderly algorithm for generation of Condorcet Domains
por: Zhou, Bei, et al.
Publicado: (2025)

Certified algorithms for numerical semigroups in Rocq
por: Bartoletti, Massimo, et al.
Publicado: (2025)

A convenient trick to compute cluster sizes in a Network
por: Hsieh, Hsun-Yi, et al.
Publicado: (2024)

Decoupling of clusters in independent sets in a percolated hypercube
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2025)

Approximation algorithms for job scheduling with block-type conflict graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2022)

A heuristic search algorithm for discovering large Condorcet domains
por: Zhou, Bei, et al.
Publicado: (2023)

Secure Domination in Bisplit graphs -- A Structural and algorithmic study
por: D, Swathi, et al.
Publicado: (2025)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

Decision problems on geometric tilings
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2024)

A recursive linear time modular decomposition algorithm via LexBFS
por: Corneil, Derek, et al.
Publicado: (2007)

Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs
por: Eidi, Marzieh, et al.
Publicado: (2025)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
por: Montanez-Barrera, Alejandro, et al.
Publicado: (2022)

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
por: Moura, Phablo F. S., et al.
Publicado: (2023)

Contribution to Blocker and Interdiction optimization problems in networks
por: Martin, Sébastien
Publicado: (2024)

Pairwise similarity method for majority domination problem
por: Shushko, N. I., et al.
Publicado: (2025)

The Closed Geodetic Game: algorithms and strategies
por: Dailly, Antoine, et al.
Publicado: (2024)

Parameterised algorithms for temporally satisfying reconfiguration problems
por: Davot, Tom, et al.
Publicado: (2025)

Karp's patching algorithm on dense digraph
por: Frieze, Alan
Publicado: (2025)

Complexity of Boolean automata networks under block-parallel update modes
por: Perrot, Kévin, et al.
Publicado: (2024)

Extended formulations for the maximum weighted co-2-plex problem
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

Fast algorithm for $S$-packing coloring of Halin graphs
por: Zhang, Xin, et al.
Publicado: (2025)

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
por: Santos, Daniela Scherer dos, et al.
Publicado: (2024)

Faster 3-colouring algorithm for graphs of diameter 3
por: Groenland, Carla, et al.
Publicado: (2026)

A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
por: Zou, Yuji, et al.
Publicado: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
por: Le, Hoang-Oanh, et al.
Publicado: (2023)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
por: Khadivi, Maziyar, et al.
Publicado: (2024)