4110 search results - page 4 / 822 » Efficient algorithms for the 2-gathering problem |
SIAMCOMP
1998
14 years 9 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
SODA
1994
ACM
14 years 11 months ago
1994
ACM
92
Voted
ESOP
2009
Springer
15 years 1 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
88
Voted
ISAAC
1994
Springer
15 years 1 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