Results 21 to 30 of about 2,188,345 (345)
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm [PDF]
Symposium on the Theory of Computing, 2018 In the Directed Steiner Tree (DST) problem we are given an n-vertex directed edge-weighted graph, a root r , and a collection of k terminal nodes. Our goal is to find a minimum-cost subgraph that contains a directed path from r to every terminal.
F. Grandoni, Bundit Laekhanukit, Shi Li
semanticscholar +1 more source
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs [PDF]
ACM Trans. Algorithms, 2017 In the classic Maximum Weight Independent Set problem, we are given a graph G with a nonnegative weight function on its vertices, and the goal is to find an independent set in G of maximum possible weight. While the problem is NP-hard in general, we give
Andrzej Grzesik +3 more
semanticscholar +1 more source
SIAM Symposium on Simplicity in Algorithms, 2020 In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showed a quasi-polynomial-time algorithm for Maximum Weight Independent Set in $P_t$-free graphs, that is, graphs excluding a fixed path as an induced subgraph.
Marcin Pilipczuk +2 more
semanticscholar +1 more source
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions [PDF]
Symposium on the Theory of Computing, 2000 This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grotschel, Lov asz, and Schrijver.
S. Iwata, L. Fleischer, S. Fujishige
semanticscholar +1 more source
A Polynomial Time Algorithm for Lossy Population Recovery [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2013 We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length n from lossy samples: for some parameter μ each coordinate of the ...
Ankur Moitra, M. Saks
semanticscholar +1 more source
Approximate cycles count in undirected graphs [PDF]
International Journal of Computational Intelligence Systems, 2014 In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to
Maytham Safar +5 more
doaj +1 more source
Analysis of Polynomial Time and Non-Polynomial Time of Algorithms
International Journal for Research in Applied Science and Engineering Technology, 2023 Abstract: The P vs NP problem is one of the most significant open problems in computer science and mathematics. This problem asks whether every problem that can be solved in polynomial time can also be verified in polynomial time. The purpose of this research paper is to explore the P vs NP problem and its relevance in the analysis of algorithms.
openaire +1 more source
A stable, polynomial-time algorithm for the eigenpair problem [PDF]
, 2014 We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time).
Peter Burgisser, F. Cucker
semanticscholar +1 more source
Efficient CSL Model Checking Using Stratification [PDF]
Logical Methods in Computer Science, 2012 For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996.
Lijun Zhang +3 more
doaj +1 more source
Polynomial-time algorithms for minimum energy scheduling [PDF]
ACM Transactions on Algorithms, 2007 The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining a satisfactory level of performance. One common method for saving energy is to simply suspend the system during idle times. No energy is consumed in the suspend mode.
Baptiste, Philippe +2 more
openaire +5 more sources