Výsledky vyhľadávania - Polynomial time solvable algorithm

Some LCPs solvable in strongly polynomial time with Lemke’s algorithm Autor 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…”
Získať plný text

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems Autor 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…”
Získať plný text

Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time Autor 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…”
Získať plný text

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix Autor 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…”
Získať plný text

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix Autor 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…”
Získať plný text

Polynomial Time Algorithms for Tracking Path Problems Autor Choudhary, Pratibha

“… In this paper we give a collection of polynomial time algorithms for some restricted versions of Tracking Paths…”
Získať plný text

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs Autor 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…”
Získať plný text

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

“… ≥ 2 variables is solvable by algorithms running in polynomial time in the number n of variables…”
Získať plný text

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

“… We show that the RBSC problem with intervals on the real line is polynomial-time solvable…”
Získať plný text

Strongly Stable and Maximum Weakly Stable Noncrossing Matchings Autor 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…”
Získať plný text

Independent sets of maximum weight beyond claw-free graphs and related problems Autor 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…”
Získať plný text

Computing optimal coalition structures in polynomial time Autor 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…”
Získať plný text

Weighted total acquisition Autor 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…”
Získať plný text

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

“…•The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable…”
Získať plný text

Algorithms for 2-balanced connected k-partition problem in graphs Autor 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…”
Získať plný text

Extracting Kernel Dataset from Big Sensory Data in Wireless Sensor Networks Autor 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…”
Získať plný text

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups Autor 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…”
Získať plný text

Computing the execution probability of jobs with replication in mixed-criticality schedules Autor 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…”
Získať plný text

Maximizing Sum Rates in Cognitive Radio Networks: Convex Relaxation and Global Optimization Algorithms Autor 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…”
Získať plný text

Connected Vertex Cover for (sP1+P5)-Free Graphs Autor 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…”
Získať plný text