4114 search results - page 11 / 823 » Efficient Algorithms for the 2-Center Problems |
142
click to vote
ISAAC
1994
Springer
15 years 8 months ago
1994
Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
138
click to vote
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
120
click to vote
STOC
1991
ACM
15 years 7 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...