Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,087,906 papers from all fields of science
Search
Sign In
Create Free Account
Weak NP-completeness
Known as:
Weakly NP-complete
In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard), if there is an algorithm for the problem…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Analysis of algorithms
Dynamic programming
Knapsack problem
Pseudo-polynomial time
Broader (1)
Computational complexity theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Configuration of planar electrical networks with and without double adduction
D. Barth
,
T. Mautor
,
Dimitri Watel
,
Marc-Antoine Weisser
2020
Corpus ID: 216158037
We consider power distribution networks containing source nodes and electricity consumer nodes. These nodes are interconnected by…
Expand
2019
2019
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition
Takuya Tamori
,
Kei Kimura
Workshop on Algorithms and Computation
2019
Corpus ID: 67773126
In this paper, we consider the feasibility problem of integer linear systems where each inequality has at most two variables…
Expand
2018
2018
Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules
Martin S. Engler
,
Bertrand Caron
,
L. Veen
,
D. Geerke
,
A. Mark
,
G. Klau
Workshop on Algorithms in Bioinformatics
2018
Corpus ID: 51936932
A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a…
Expand
2017
2017
On the Min-Max-Delay Problem: NP-completeness, Algorithm, and Int-Gap
Qingyu Liu
,
Lei Deng
,
Haibo Zeng
,
Minghua Chen
arXiv.org
2017
Corpus ID: 126088243
We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at…
Expand
2017
2017
On the min-max-delay problem: NP-completeness, algorithm, and integrality gap
Qingyu Liu
,
Lei Deng
,
Haibo Zeng
,
Minghua Chen
Information Theory Workshop
2017
Corpus ID: 24482060
We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G = (V, E…
Expand
2017
2017
Product Pricing with Additive Influences - Algorithms and Complexity Results for Pricing in Social Networks
Florian D. Schwahn
2017
Corpus ID: 52251252
We introduce and investigate a product pricing model in social networks where the value a possible buyer assigns to a product is…
Expand
2017
2017
On the Min-Max-Delay Problem: Complexity, Algorithm, and Int-Gap
Qingyu Liu
,
Lei Deng
,
Haibo Zeng
,
Minghua Chen
2017
Corpus ID: 125291699
We study a flow problem where a source streams information to a sink over a directed graph G , (V,E) possibly using multiple…
Expand
2011
2011
Double digest revisited Complexity and approximability in the presence of noisy data
2011
Corpus ID: 19026423
2006
2006
Unfolding and Reconstructing Polyhedra
Brendan Lucier
2006
Corpus ID: 122785490
This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information…
Expand
2006
2006
The complex of sensor placement in municipal water networks.
C. Phillips
,
Henry Lin
,
Erik Lauer
2006
Corpus ID: 116698215
This paper considers the problem of optimally placing sensors in water networks to minimize the expected damage due to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE