Sciweavers

Share
2 search results - page 1 / 1
» Efficient Algorithms for Centers and Medians in Interval and...
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
10 years 6 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
10 years 2 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
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,...
Maw-Shang Chang
books