TY - GEN

T1 - Approximate maxima finding of continuous functions under restricted budget

AU - Kranakis, Evangelos

AU - Krizanc, Danny

AU - Pelc, Andrzej

AU - Peleg, David

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84896768496&partnerID=8YFLogxK

U2 - 10.1007/3-540-62559-3_22

DO - 10.1007/3-540-62559-3_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84896768496

SN - 3540625593

SN - 9783540625599

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 278

BT - Graph-Theoretic Concepts in Computer Science - 22nd International Workshop, WG 1996, Proceedings

T2 - 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1996

Y2 - 12 June 1996 through 14 June 1996

ER -