Výsledky vyhledávání - complexity and algorithms

Fixed interval scheduling: Models, applications, computational complexity and algorithms Autor 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…”
Získat plný text

MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms Autor 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…”
Získat plný text

Makespan optimization in a single-machine scheduling problem with dynamic job ready times—Complexity and algorithms Autor Gorczyca, Mateusz, Janiak, Adam, Janiak, Wladyslaw, Dymański, Marcin

“…An industrial problem encountered in steel mills is considered in the paper. The problem is formulated as a single-processor scheduling problem with a dynamic…”
Získat plný text

Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms Autor Lin, Meichun, Huh, Woonghee Tim, Wan, Guohua

“… Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well…”
Získat plný text

Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms Autor Benoit, Anne, Canon, Louis-Claude, Jeannot, Emmanuel, Robert, Yves

“… We fill a complexity gap of the scheduling literature: our main result is that this reliability problem is # P ′-Complete…”
Získat plný text

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

“… In particular, we explore the notions of disjoint, distinct and symmetric allocations and study their complexity in terms of the fairness notions of envy-freeness and equitability up to one item…”
Získat plný 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 theoretical developments, many in the direction of AI…”
Získat plný text

Complexity and algorithms for nonlinear optimization problems Autor Hochbaum, Dorit S.

“…Nonlinear optimization algorithms are rarely discussed from a complexity point of view…”
Získat plný text

Unique Response Roman Domination: Complexity and Algorithms Autor 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…”
Získat plný text

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

“… In this paper, we investigate the complexity of recognizing k+-real face graphs, that is, the complexity of testing whether a given graph is k+…”
Získat plný text

Eternal connected vertex cover problem in graphs: Complexity and algorithms Autor 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,…”
Získat plný text

Container Scheduling: Complexity and Algorithms Autor Choi, Byung-Cheon, Lee, Kangbok, Leung, Joseph Y.-T., Pinedo, Michael L., Briskorn, Dirk

“…We consider the transport of containers through a fleet of ships. Each ship has a capacity constraint limiting the total number of containers it can carry and…”
Získat plný text

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors Autor Misra, Neeldhara, Rosamond, Frances, Zehavi, Meirav

“…This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity…”
Získat plný text

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices Autor 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…”
Získat plný text

Upward Book Embeddability of st-Graphs: Complexity and Algorithms Autor 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…”
Získat plný text

Complexity and algorithms for injective edge-coloring in graphs Autor 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…”
Získat plný text

Complexity and algorithms for injective edge coloring of graphs Autor 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…”
Získat plný text

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

“…?•We determine the computational complexity of this and related problems for different values of d…”
Získat plný text

Roman {3}-domination in graphs: Complexity and algorithms Autor 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…”
Získat plný text

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

“… First, we discuss the complexity difference between Min-PIDF and the problem of finding the minimum weight of an Italian dominating function…”
Získat plný text