Results 261 to 270 of about 187,749 (326)

Parameterized Complexities of Dominating and Independent Set Reconfiguration. [PDF]

Algorithmica
Bodlaender HL, Groenland C, Swennenhuis CMF.   +2 more
europepmc   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

Integrating Pythagorean fuzzy numbers into the graph model to resolve water resource conflicts in the Yellow River Basin. [PDF]

Sci Rep
Cao Y.
europepmc   +1 more source

Investigating Mixed‐Integer Programming Approaches for the p$$ p $$‐α$$ \alpha $$‐Closest‐Center Problem

Networks, EarlyView.
ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar, Sara Joosten, Markus Sinnl   +2 more
wiley   +1 more source

Decoupling between activation time and steady-state level in input-output responses. [PDF]

PLoS Comput Biol
Ravanelli G, Nam KM, Gunawardena J, Martinez-Corral R.   +3 more
europepmc   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source

Habitat loss reshuffles ecological and evolutionary interactions in a seed dispersal network

Oikos, EarlyView.
In tropical forests, habitat loss reshapes species composition, favoring generalists and recently emerged lineages while specialists and older evolutionary lineages are lost. However, how changes in species ecological attributes and evolutionary history affect ecological processes is poorly explored.
Fernando César Gonçalves Bonfim, Mauro Galetti, Elaine Rios, Cynthia Oliveira, Milena Gama, Ketlen Bona, Geanne Carla Novais‐ Pereira, Thiago de Castro Ribeiro, Eliana Cazetta   +8 more
wiley   +1 more source

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. [PDF]

Algorithmica
Benford A, Lehre PK.
europepmc   +1 more source

Analysis of the Crashworthiness of Novel Flax‐Fiber Hybrid Reinforced Three‐Dimensional Woven Composites

Polymer Composites, EarlyView.
Through‐thickness binder yarns in tailored three‐dimensional woven flax‐fiber composites stabilize damage propagation and promote progressive crushing, enhancing crashworthiness and energy absorption. ABSTRACT This study investigates the impact crashworthiness performance of flax‐fiber reinforced three‐dimensional (3D) composites through a ...
H. F. M. de Queiroz, A. Ciampaglia, M. D. Banea, R. Ciardiello   +3 more
wiley   +1 more source