Výsledky vyhľadávania - "Polynomial algorithm"

Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling Autor Sáez, Pablo

“…We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not…”
Získať plný text

The method to improve the accuracy of experiment using helium instead of hydrogen Autor Chen, Lihua, Hong, Yingchen, Qi, Wei, Yao, Zhanhui, Jiang, Xiaolong, Zhao, Ziming, Li, Yuejuan

“…Based on the hydrogen-helium similarity theory, the leakage experiments using helium instead of hydrogen can effectively reduce the risk of hydrogen…”
Získať plný text

(1,1)-Cluster Editing is polynomial-time solvable Autor Gutin, Gregory, Yeo, Anders

“…A graph H is a clique graph if H is a vertex-disjoin union of cliques. Abu-Khzam (2017) introduced the (a,d)-Cluster Editing problem, where for fixed natural…”
Získať plný text

Weakly robust global optimization of max-plus linear systems with non-negative constraint sets and its application to optimizing time parameters in data transmission systems Autor Yang, Weili, Tao, Yuegang, Liu, Weipeng

“…This paper considers the weakly robust global optimization problem of max-plus linear systems with non-negative constraint sets. A characteristic of the weak…”
Získať plný text

On the -forcing number: computational approach and exact values Autor Aida Abiad, Maryam Moghaddas

“…Zero forcing is a graph coloring process that is used to model spreading phenomena in real-world scenarios. It can also be viewed as a single-player…”
Získať plný text

On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables Autor Pessoa, Artur, de Araujo, Daniel, Uchoa, Eduardo

“…Mixed integer programming formulations for the Split Delivery Vehicle Routing Problem (SDVRP) typically use edge decision variables. It was believed that…”
Získať plný text

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems Autor Könen, David, Stiglmayr, Michael

“…This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It…”
Získať plný text

Safe sets and in-dominating sets in digraphs Autor Bai, Yandong, Bang-Jensen, Jørgen, Fujita, Shinya, Ono, Hirotaka, Yeo, Anders

“…A non-empty subset S of the vertices of a digraph D is a safe set if (i) for every strongly connected component M of D−S, there exists a strongly connected…”
Získať plný text

L 0-regularization for high-dimensional regression with corrupted data Autor Zhang, Jie, Li, Yang, Zhao, Ni, Zheng, Zemin

“…Corrupted data appears widely in many contemporary applications including voting behavior, high-throughput sequencing and sensor networks. In this article, we…”
Získať plný text

Fractional modelling and numerical simulations of variable-section viscoelastic arches Autor Dang, Rongqi, Chen, Yiming

“…•The fractional governing equations of three variable section viscoelastic arches are established based on two fractional viscoelastic constitutive…”
Získať plný text

Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule Autor Kats, Vladimir, Levner, Eugene

Získať plný text

AlienTrimmer: A tool to quickly and accurately trim off multiple short contaminant sequences from high-throughput sequencing reads Autor Criscuolo, Alexis, Brisse, Sylvain

“…Contaminant oligonucleotide sequences such as primers and adapters can occur in both ends of high-throughput sequencing (HTS) reads. AlienTrimmer was developed…”
Získať plný text

Global optimization for max-plus linear systems and applications in distributed systems Autor Tao, Yuegang, Wang, Cailu

“…This paper considers the global optimization of max-plus linear systems with affine equality constraints. For both the cases that the variables are real and…”
Získať plný text

Spanning eulerian subdigraphs in semicomplete digraphs Autor Bang‐Jensen, Jørgen, Havet, Frédéric, Yeo, Anders

“…A digraph is eulerian if it is connected and every vertex has its in‐degree equal to its out‐degree. Having a spanning eulerian subdigraph is thus a weakening…”
Získať plný text

Polynomial verification for safe codiagnosability of decentralized fuzzy discrete-event systems Autor Liu, Fuchun, Cao, Weihua, Dziong, Zbigniew

“…Since fuzzy discrete-event systems (FDESs) modeled by fuzzy automata were put forward, extensive research on FDESs has been successfully conducted from…”
Získať plný text

Fair integral submodular flows Autor Frank, András, Murota, Kazuo

“…Integer-valued elements of an integral submodular flow polyhedron Q are investigated which are decreasingly minimal (dec-min) in the sense that their largest…”
Získať plný text

Complexity and algorithms for constant diameter augmentation problems Autor 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…”
Získať plný text

Identities of the Kauffman monoid Autor Chen, Yuzhu, Hu, Xun, Kitov, Nikita V., Luo, Yanfeng, Volkov, Mikhail V.

“…We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid Our characterization leads to a polynomial time…”
Získať plný text

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph Autor Smirnov, Alexander Valeryevich

“…In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and…”
Získať plný text

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties Autor Bang-Jensen, J., Yeo, A.

“…As usual λ(G) denotes the edge-connectivity of the graph G. It was shown in [2] that every graph G contains a spanning (λ(G)+1)-partite subgraph H such that…”
Získať plný text