Suchergebnisse - Polynomial time solvable algorithm

Some LCPs solvable in strongly polynomial time with Lemke’s algorithm von Adler, Ilan, Cottle, Richard W., Pang, Jong-Shi

“… We identify a class of Linear Complementarity Problems (LCPs) that are solvable in strongly polynomial time by Lemke’s Algorithm (Scheme 1 …”
Volltext

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems von Gu, Shenshen, Cui, Rui, Peng, Jiao

“… We first deduce the polynomial time solvable algorithms to the unconstrained binary quadratic programming problems with Q being a seven-diagonal matrix (UBQP7 …”
Volltext

Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time von V. G. Naidenko

“… BPP (abbreviation for bounded-error probablistic polynomial time) represents the class of computational decision problems that are efficiently solvable in polynomial time …”
Volltext

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix von Shenshen Gu, Rui Cui

“… However, it's NP-hard and lacks efficient algorithms. Due to this reason, in this paper, a novel polynomial algorithm to linearly constrained binary quadratic …”
Volltext

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix von Shenshen Gu

“… In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed …”
Volltext

Polynomial Time Algorithms for Tracking Path Problems von Choudhary, Pratibha

“… In this paper we give a collection of polynomial time algorithms for some restricted versions of Tracking Paths …”
Volltext

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs von Giannopoulou, Archontia C., Mertzios, George B., Niedermeier, Rolf

“… We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time …”
Volltext

On algorithms testing positivity of real symmetric polynomials von Timofte, Vlad, Timofte, Aida

“… ≥ 2 variables is solvable by algorithms running in polynomial time in the number n of variables …”
Volltext

On the geometric red-blue set cover problem von Madireddy, Raghunath Reddy, Nandy, Subhas C., Pandit, Supantha

“… We show that the RBSC problem with intervals on the real line is polynomial-time solvable …”
Volltext

Strongly Stable and Maximum Weakly Stable Noncrossing Matchings von Hamada, Koki, Miyazaki, Shuichi, Okamoto, Kazuya

“… In this paper, we show that both problems are solvable in polynomial time. Our algorithms are applicable to extensions where preference lists …”
Volltext

Independent sets of maximum weight beyond claw-free graphs and related problems von Brandstädt, Andreas, Lozin, Vadim, Mosca, Raffaele

“… In particular, due to the celebrated Edmonds' matching algorithm, WIS is solvable in polynomial time in the class of line graphs …”
Volltext

Computing optimal coalition structures in polynomial time von Fatima, Shaheen, Wooldridge, Michael

“… In this article, we identify some problem instances for which the space of possible coalition structures has a certain form and constructively prove that the problem is polynomial time solvable …”
Volltext

Weighted total acquisition von Bagan, Guillaume, Gledel, Valentin, Heinrich, Marc, Mc Inerney, Fionn

“… In the Weighted Total Acquisition problem (WTA) on a weighted graph G (only positive non-zero weights), a vertex v can acquire the total weight of a neighbour …”
Volltext

Single-machine scheduling of multiple projects with controllable processing times von Geng, Zhichao, Yuan, Jinjiang

“… •The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable …”
Volltext

Algorithms for 2-balanced connected k-partition problem in graphs von Yu, Junran, Hu, Jing, Gao, Jiaquan, Du, Donglei, Zhang, Xiaoyan

“… Furthermore, we prove that these algorithms are polynomial-time solvable on degree-bounded graphs, thereby refining and extending the results of Caragiannis et al …”
Volltext

Extracting Kernel Dataset from Big Sensory Data in Wireless Sensor Networks von Cheng, Siyao, Cai, Zhipeng, Li, Jianzhong, Gao, Hong

“… The amount of sensory data manifests an explosive growth due to the increasing popularity of Wireless Sensor Networks (WSNs). The scale of sensory data in many …”
Volltext

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups von Dey, Sanjana, Foucaud, Florent, Nandy, Subhas C., Sen, Arunabha

“… We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite set of points P and a finite set of objects …”
Volltext

Computing the execution probability of jobs with replication in mixed-criticality schedules von Novak, Antonin, Hanzalek, Zdenek

“… Mixed-criticality scheduling addresses the problem of sharing common resources among jobs of different degrees of criticality and uncertain processing times …”
Volltext

Maximizing Sum Rates in Cognitive Radio Networks: Convex Relaxation and Global Optimization Algorithms von Zheng, Liang, Tan, Chee Wei

“… A key challenge in wireless cognitive radio networks is to maximize the total throughput also known as the sum rates of all the users while avoiding the …”
Volltext

Connected Vertex Cover for (sP1+P5)-Free Graphs von Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

“… if  H is not a linear forest. On the other hand, the problem is known to be polynomial-time solvable for s P 2 -free graphs for any integer  s ≥ 1 …”
Volltext