{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:28:31Z","timestamp":1761974911353,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642384561"},{"type":"electronic","value":"9783642384578"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38457-8_17","type":"book-chapter","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T00:57:34Z","timestamp":1367888254000},"page":"199-210","source":"Crossref","is-referenced-by-count":2,"title":["Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree"],"prefix":"10.1007","author":[{"given":"Yang","family":"Xiang","sequence":"first","affiliation":[]},{"given":"Kamala","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Proc. 19th ACM Symp. Theory of Computing, pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"issue":"3-4","key":"17_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-308","volume":"102","author":"I. Brito","year":"2010","unstructured":"Brito, I., Meseguer, P.: Cluster tree elimination for distributed constraint optimization with quality guarantees. Fundamenta Informaticae\u00a0102(3-4), 263\u2013286 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Molle, M.: Optimal distributed algorithm for minimum spanning trees revisited. In: Proc. 14th Annual ACM Symp. Principles of Distributed Computing, pp. 231\u2013237 (1995)","DOI":"10.1145\/224964.225474"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Faltings, B., Leaute, T., Petcu, A.: Privacy guarantees through distributed constraint satisfaction. In: Proc. IEEE\/WIC\/ACM Intelligent Agent Technology, pp. 350\u2013358 (2008)","DOI":"10.1109\/WIIAT.2008.177"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Programming Languages and Systems\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/S0097539794261118","volume":"27","author":"J. Garay","year":"1998","unstructured":"Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput.\u00a027(1), 302\u2013316 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1011495811107","volume":"4","author":"P. Gmytrasiewicz","year":"2001","unstructured":"Gmytrasiewicz, P., Durfee, E.: Rational communication in multi-agent environments. Auto. Agents and Multi-Agent Systems\u00a04(3), 233\u2013272 (2001)","journal-title":"Auto. Agents and Multi-Agent Systems"},{"key":"17_CR8","unstructured":"Jensen, F.: Junction tree and decomposable hypergraphs. Tech. rep., JUDEX, Aalborg, Denmark (February 1988)"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00446-007-0047-8","volume":"20","author":"M. Khan","year":"2008","unstructured":"Khan, M., Pandurangan, G.: A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing\u00a020(6), 391\u2013402 (2008)","journal-title":"Distributed Computing"},{"key":"17_CR10","unstructured":"Koller, D., Milch, B.: Multi-agent influence diagrams for representing and solving games. In: Proc. 17th Inter. Joint Conf. on Artificial Intelligence, pp. 1027\u20131034 (2001)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jagm.1998.0929","volume":"28","author":"S. Kutten","year":"1998","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of smallk-dominating sets and applications. J. Algorithms\u00a028(1), 40\u201366 (1998)","journal-title":"J. Algorithms"},{"key":"17_CR12","unstructured":"Maestre, A., Bessiere, C.: Improving asynchronous backtracking for dealing with complex local problems. In: Proc. 16th European Conf. on Artificial Intelligence, pp. 206\u2013210 (2004)"},{"issue":"1-2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"P. Modi","year":"2005","unstructured":"Modi, P., Shen, W., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligences\u00a0161(1-2), 149\u2013180 (2005)","journal-title":"Artificial Intelligences"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Nobari, S., Cao, T., Karras, P., Bressan, S.: Scalable parallel minimum spanning forest computation. In: Proc. 17th ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 205\u2013214 (2012)","DOI":"10.1145\/2145816.2145842"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Paskin, M., Guestrin, C., McFadden, J.: A robust architecture for distributed inference in sensor networks. In: Proc. Information Processing in Sensor Networks, pp. 55\u201362 (2005)","DOI":"10.1109\/IPSN.2005.1440895"},{"key":"17_CR16","unstructured":"Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proc. 19th Inter. Joint Conf. on Artificial Intelligence, pp. 266\u2013271 (2005)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Prim, R.: Shortest connection networks and some generalizations. Bell Syst. Tech. J.\u00a0(36), 1389\u20131401 (1957)","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"17_CR18","unstructured":"Silaghi, M., Abhyankar, A., Zanker, M., Bartak, R.: Desk-mates (stable matching) with privacy of preferences, and a new distributed CSP framework. In: Proc. Inter. Florida Artificial Intelligence Research Society Conf., pp. 83\u201396 (2005)"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0888-613X(01)00056-1","volume":"29","author":"M. Valtorta","year":"2002","unstructured":"Valtorta, M., Kim, Y., Vomlel, J.: Soft evidential update for probabilistic multiagent systems. Int. J. Approximate Reasoning\u00a029(1), 71\u2013106 (2002)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10458-010-9132-7","volume":"22","author":"M. Vinyals","year":"2010","unstructured":"Vinyals, M., Rodriguez-Aguilar, J., Cerquides, J.: Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law. J. Autonomous Agents and Multi-Agent Systems\u00a022(3), 439\u2013464 (2010)","journal-title":"J. Autonomous Agents and Multi-Agent Systems"},{"issue":"1-2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(95)00110-7","volume":"87","author":"Y. Xiang","year":"1996","unstructured":"Xiang, Y.: A probabilistic framework for cooperative multi-agent distributed interpretation and optimization of communication. Artificial Intelligence\u00a087(1-2), 295\u2013342 (1996)","journal-title":"Artificial Intelligence"},{"key":"17_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546938","volume-title":"Probabilistic Reasoning in Multiagent Systems: A Graphical Models Approach","author":"Y. Xiang","year":"2002","unstructured":"Xiang, Y.: Probabilistic Reasoning in Multiagent Systems: A Graphical Models Approach. Cambridge University Press, Cambridge (2002)"},{"key":"17_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-24840-8_25","volume-title":"Advances in Artificial Intelligence","author":"Y. Xiang","year":"2004","unstructured":"Xiang, Y., Chen, J., Deshmukht, A.: A decision-theoretic graphical model for collaborative design on supply chains. In: Tawfik, A.Y., Goodwin, S.D. (eds.) Canadian AI 2004. LNCS (LNAI), vol.\u00a03060, pp. 355\u2013369. Springer, Heidelberg (2004)"},{"issue":"6","key":"17_CR24","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1142\/S0218488511007416","volume":"19","author":"Y. Xiang","year":"2011","unstructured":"Xiang, Y., Hanshar, F.: Multiagent expedition with graphical models. Inter. J. Uncertainty, Fuzziness and Knowledge-Based Systems\u00a019(6), 939\u2013976 (2011)","journal-title":"Inter. J. Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Mohamed, Y., Zhang, W.: Distributed constraint satisfaction with multiply sectioned constraint networks. Accepted to appear in International J. Information and Decision Sciences (2013)","DOI":"10.1504\/IJIDS.2014.061771"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Srinivasan, K.: Boundary set based existence recognition and construction of hypertree agent organization. In: Za\u00cfane, O., Zilles, S. (eds.) Canadian AI 2013. LNCS (LNAI), vol.\u00a07884, pp. 187\u2013198. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38457-8_16"},{"key":"17_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72665-4_20","volume-title":"Advances in Artificial Intelligence","author":"Y. Xiang","year":"2007","unstructured":"Xiang, Y., Zhang, W.: Multiagent constraint satisfaction with multiply sectioned constraint networks. In: Kobti, Z., Wu, D. (eds.) Canadian AI 2007. LNCS (LNAI), vol.\u00a04509, pp. 228\u2013240. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38457-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:48:36Z","timestamp":1746002916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38457-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642384561","9783642384578"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38457-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}