2957 search results - page 160 / 592 » The Complexity of Polynomial-Time Approximation |
136
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
152
click to vote
COCOON
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
180
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
175
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
166
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...