Search Results - "complexity and algorithms"

Diverse fair allocations: Complexity and algorithms by Mittal, Harshil, Nanoti, Saraswati, Sethia, Aditi

“…In this work, we initiate the study of diversity of solutions in the context of fair division of indivisible goods. In particular, we explore the notions of…”
Get full text

New Frontiers in Parameterized Complexity and Algorithms

“…The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new…”
Get full text

Drawing graphs with k vertices per face: Complexity and algorithms by Bekos, Michael A., Di Battista, Giuseppe, Di Giacomo, Emilio, Didimo, Walter, Kaufmann, Michael, Montecchiani, Fabrizio

“…A drawing Γ of a graph G divides the plane into topologically connected regions, called faces (or cells). The boundary of each face is formed by vertices,…”
Get full text

Eternal connected vertex cover problem in graphs: Complexity and algorithms by Paul, Kaustav, Pandey, Arti

“…This paper deals with a dynamic variant of vertex cover problem, known as the eternal vertex cover problem. This is a two-player (attacker and defender) game,…”
Get full text

Unique Response Roman Domination: Complexity and Algorithms by Banerjee, Sumanta, Chaudhary, Juhi, Pradhan, Dinabandhu

“…A function f : V ( G ) → { 0 , 1 , 2 } is called a Roman dominating function on G = ( V ( G ) , E ( G ) ) if for every vertex v with f ( v ) = 0 , there exists…”
Get full text

Fixed interval scheduling: Models, applications, computational complexity and algorithms by Kovalyov, Mikhail Y., Ng, C.T., Cheng, T.C. Edwin

“…The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed…”
Get full text

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices by Li, Wenjun, Xu, Huayi, Li, Huixi, Yang, Yongjie, Sharma, Pradip Kumar, Wang, Jin, Singh, Saurabh

“…As a successful application of edge computing in the industrial production environment, prolonging the smart devices' (SDs') battery lifetime has become an…”
Get full text

Complexity and algorithms for injective edge-coloring in graphs by Foucaud, Florent, Hocquard, Hervé, Lajou, Dimitri

“…•We start a systematic study of the complexity of INJECTIVE k-EDGE-COLORING.•INJECTIVE k-EDGE-COLORING for k=3,4 is hard for restricted classes of subcubic…”
Get full text

MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms by Gascon, Mathieu, Dondi, Riccardo, El-Mabrouk, Nadia

“…A multi-labeled tree (or MUL-tree) is a rooted tree in which every leaf is labeled by an element from some set X, but in which more than one leaf may be…”
Get full text

Upward Book Embeddability of st-Graphs: Complexity and Algorithms by Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio

“…A k - page upward book embedding ( k UBE) of a directed acyclic graph  G is a book embeddings of  G on k pages with the additional requirement that the…”
Get full text

Roman {3}-domination in graphs: Complexity and algorithms by Chaudhary, Juhi, Pradhan, Dinabandhu

“…A Roman{3}-dominating function on a graph G is a function f:V(G)→{0,1,2,3} having the property that for any vertex u∈V(G), if f(u)=0, then ∑v∈NG(u)f(v)≥3, and…”
Get full text

Complexity and algorithms for injective edge coloring of graphs by Priyamvada, Panda, B.S.

“…An injective k-edge-coloring of a graph G=(V,E) is an assignment ω:E→{1,2,…,k} of colors to the edges of G such that any two edges e and f receive distinct…”
Get full text

Complexity and algorithms for constant diameter augmentation problems by Kim, Eun Jung, Milanič, Martin, Monnot, Jérôme, Picouleau, Christophe

“…•For given integers d, k and graph G, can we obtain a graph with diameter d via at most k edge deletions?•We determine the computational complexity of this and…”
Get full text

Perfect Italian domination in graphs: Complexity and algorithms by Pradhan, D., Banerjee, S., Liu, Jia-Bao

“…An Italian dominating function on a simple undirected graph G is a function f:V(G)⟶{0,1,2} satisfying the condition that for each vertex v with f(v)=0,…”
Get full text

Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms by Banfi, Jacopo, Basilico, Nicola, Amigoni, Francesco

“…In several multirobot applications in which communication is limited, the mission could require the robots to iteratively take coordinated joint decisions on…”
Get full text

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles by Le, Hoang-Oanh, Le, Van Bang

“…In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. matching cut (mc), respectively, perfect matching cut (pmc), is the problem…”
Get full text

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms by Astaoui, Walid, Magnouche, Youcef, Martin, Sébastien

“…Let us consider a connected undirected graph G = ( V , E , d , w ) with a set of nodes V , a set of edges E , an edge distance vector d , and an edge weight…”
Get full text

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms by Pikies, Tytus, Turowski, Krzysztof, Kubale, Marek

“…In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can…”
Get full text

Complexity and algorithms for constant diameter augmentation problems by Kim, Eun Jung, Milanic, Martin, Monnot, Jérôme, Picouleau, Christophe

“…We study the following problem: for given integers $d,k$ and graph $G$, can we obtain a graph with diameter $d$ via at most $k$ edge deletions ? We determine…”
Get full text

Covering a simplex by spheres: complexity and algorithms by Zhang, Tongli, Xia, Yong

“…Simplex covering optimization problem (SCO) is modeled from the application of covering a simplex by m given balls. It contains the maximin dispersion problem…”
Get full text