This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

This paper proposes a reliability-aware framework to solve the fuzzy shortest path problem in directed graphs, optimizing routes based not only on cost but also on the reliability of the associated fu…

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

The paper proposes a novel Bayesian framework to learn the optimal decision strategy for the stochastic shortest path problem by directly constructing the posterior beliefs for the action-value functi…

The paper introduces GONDOR, a memory-efficient extension of Greedy Best-First Search (GBFS) that enables search continuation under strict memory constraints by periodically compressing the search tre…

The paper introduces a diffusion-based uncertainty model for robust optimization on graphs, showing that the resulting computational complexity depends critically on the interaction between the uncert…

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in lattices by incorporating domain-informed representation, thereby extending its applicability to modul…

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in both integral and module lattices by incorporating domain-informed representation and crossover.

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

The paper proposes a novel Large Neighborhood Search (LNS) method, incorporating hybrid destroy operators and an exact repair solver, to effectively solve the Capacitated Facility Location Problem wit…

The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

The paper presents an end-to-end system that translates high-level operator intents into low-level, safe routing constraints for LEO mega-constellations, achieving high accuracy and safety guarantees.

The paper introduces R$^2$A, an adversarial attack that uses suffix optimization to mislead black-box LLM routers into consistently selecting expensive, high-capability models.

The paper empirically and theoretically demonstrates that incorporating Lamarckian and Baldwinian mechanisms into evolutionary algorithms significantly outperforms standard Darwinian evolution, especi…