Cover Image

Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Díaz-Bañez, José-Miguel, Higes-López, José-Manuel, Pérez-Cutiño, Miguel-Angel, Todtenhaupt, Tom
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)

Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Excluding a rectangular grid
by: Rambaud, Clément
Published: (2025)

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

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters
by: Donne, Diego Delle, et al.
Published: (2024)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

More efficient sifting for grid norms, and applications to multiparty communication complexity
by: Kelley, Zander, et al.
Published: (2025)

Extended formulations for induced tree and path polytopes of chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2025)

Agglomeration based influential node ranking in path-type networks
by: Berberler, Zeynep Nihan, et al.
Published: (2025)

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

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

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

Ramsey Goodness of paths and unbalanced graphs
by: Botler, Fábio, et al.
Published: (2024)

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

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

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

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

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

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
by: Matsui, Yasuko, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)

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

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

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

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

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)