Abstract
A function is distributed among nodes of a graph in a“continuous” way, i.e., such that the difference between values stored at adjacent nodes is small. The goal is to find a node of maximum value by probing some nodes under a restricted budget. Every node has an associated cost which has to be paid for probing it and a probe reveals the value of the node. If the total budget is too small to allow probing every node, it is impossible to find the maximum value in the worst case. Hence we seek an Approximate Maxima Finding (AMF) algorithm that offers the best worst-case guarantee g, i.e., for any continuous distribution of values it finds a node whose value differs from the maximum value by at most g.
Approximate Maxima Finding in graphs is related to a generalization of the multicenter problem and we get new results for this problem as well. For example, we give a polynomial algorithm to find a minimum cost solution for the multicenter problem on a tree, with arbitrary node costs.
Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grants.
Part of this research was performed while the fourth author was visiting Carleton University as a COGNOS scholar.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. H. Gormen, G. E. Leiserson, and R. L. Rivest, “Introduction to Algorithms”, Electrical Engineering and Computer Science Series, M.I.T. Press, 1990.
S. L. Hakimi, E. F. Schmeichel, and M. Labbé, “On Locating Pathor Tree-Shaped Facilities on Networks”, Networks, Vol. 23 (1993) 543–555.
O. Kariv and S. L. Hakimi, “An Algorithmic Approach to Network Location Problems. I: the p-Centers”, SIAM J. Appl. Math., Vol. 37, No 3, Dec. 1979.
D. S. Hochbaum and D. B. Shmoys, “Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems”, in Proceedings of STOC 1984, pp. 324–333.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Pelc, A., Peleg, D. (1997). Approximate maxima finding of continuous functions under restricted budget (Extended abstract). In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-62559-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62559-9
Online ISBN: 978-3-540-68072-7
eBook Packages: Springer Book Archive