Results 211 to 220 of about 1,055,399 (260)
Some of the next articles are maybe not open access.
The Directed Orienteering Problem
Algorithmica, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Viswanath Nagarajan, R. Ravi 0001
openaire +2 more sources
Proceedings of the first annual symposium on Computational geometry - SCG '85, 1985
Given two points a=(a1,a2,…,ad) and b=(b1,b2,…,bd) in d-dimensional space, a dominates b if a≠b and for each i=1…d holds ai≥bi. The direct dominance problem consists of computing a relation of minimal size on a given set of n points such that the transitive closure of the relation gives all the dominances in the set.
Ralf Hartmut Güting +2 more
openaire +1 more source
Given two points a=(a1,a2,…,ad) and b=(b1,b2,…,bd) in d-dimensional space, a dominates b if a≠b and for each i=1…d holds ai≥bi. The direct dominance problem consists of computing a relation of minimal size on a given set of n points such that the transitive closure of the relation gives all the dominances in the set.
Ralf Hartmut Güting +2 more
openaire +1 more source
“Direction” in Problem Solving
The Journal of Psychology, 1949(1949). “Direction” in Problem Solving. The Journal of Psychology: Vol. 27, No. 2, pp. 331-345.
H E, WEAVER, E H, MADDEN
openaire +2 more sources
On the addressing problem for directed graphs
Graphs and Combinatorics, 1985zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +2 more
openaire +2 more sources
The Directed Planar Reachability Problem
2005We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is logspace-reducible to its complement, and we show that the problem of searching graphs of genus 1 reduces to the planar case.
Eric Allender +2 more
openaire +2 more sources
The directed circular arrangement problem
ACM Transactions on Algorithms, 2010We consider the problem of embedding a directed graph onto evenly spaced points on a circle while minimizing the total weighted edge length. We present the first poly-logarithmic approximation factor algorithm for this problem which yields an approximation factor of O (log n log log
Joseph Naor, Roy Schwartz 0002
openaire +3 more sources
Information Processing Letters, 1982
Abstract The maximal-cut problem for directed graphs can be defined analogously to that for the undirected case. The undirected problem is known to be NP-complete. We consider two directed variants of the problem. Depending on the definition of the value of a cut, the resulting problem for general directed graphs is either efficiently solvable or NP ...
Arthur M. Farley, Andrzej Proskurowski
openaire +2 more sources
Abstract The maximal-cut problem for directed graphs can be defined analogously to that for the undirected case. The undirected problem is known to be NP-complete. We consider two directed variants of the problem. Depending on the definition of the value of a cut, the resulting problem for general directed graphs is either efficiently solvable or NP ...
Arthur M. Farley, Andrzej Proskurowski
openaire +2 more sources
Addressing the Numbers Problem in Directed Evolution
ChemBioChem, 2008Abstract Our previous contribution to increasing the efficiency of directed evolution is iterative saturation mutagenesis (ISM) as a systematic means of generating focused libraries for the control of substrate acceptance, enantioselectivity, or thermostability of enzymes.
Reetz, M., Kahakeaw, D., Lohmer, R.
openaire +3 more sources