{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T01:58:35Z","timestamp":1777514315902,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030430887","type":"print"},{"value":"9783030430894","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43089-4_2","type":"book-chapter","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T16:04:08Z","timestamp":1588781048000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach"],"prefix":"10.1007","author":[{"given":"Kasra","family":"Khosoussi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav S.","family":"Sukhatme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoudong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gamini","family":"Dissanayake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,7]]},"reference":[{"key":"2_CR1","unstructured":"Bailey, R.A., Cameron, P.J.: Combinatorics of optimal designs. Surveys in Combinatorics 365 (2009) 19\u201373"},{"key":"2_CR2","unstructured":"Bauer, D., Boesch, F.T., Suffel, C., Van Slyke, R.: On the validity of a reduction of reliable network design to a graph extremal problem. Circuits and Systems, IEEE Transactions on 34(12) (1987) 1579\u20131581"},{"key":"2_CR3","unstructured":"Boesch, F.T., Satyanarayana, A., Suffel, C.L.: A survey of some network reliability analysis and synthesis results. Networks 54(2) (2009) 99\u2013107"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge university press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"2_CR5","unstructured":"Cheng, C.S.: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory. Journal of Combinatorial Theory, Series B 31(2) (1981) 240\u2013248"},{"key":"2_CR6","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9(3) (2008) 432\u2013441"},{"key":"2_CR7","unstructured":"Gaffke, N.: D-optimal block designs with at most six varieties. Journal of Statistical Planning and Inference 6(2) (1982) 183\u2013200"},{"key":"2_CR8","unstructured":"Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. SIAM review 50(1) (2008) 37\u201366"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.: Algebraic graph theory. Graduate Texts in Mathematics Series. Springer London, Limited (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"2_CR10","unstructured":"Gutman, I.,Mallion, R., Essam, J.: Counting the spanning trees of a labelled molecular-graph. Molecular Physics 50(4) (1983) 859\u2013877"},{"key":"2_CR11","unstructured":"Hochbaum, D.S.: Approximation algorithms for NP-hard problems. PWS Publishing Co. (1996)"},{"key":"2_CR12","unstructured":"Huang, G., Kaess, M., Leonard, J.J.: Consistent sparsification for graph optimization. In: Mobile Robots (ECMR), 2013 European Conference on, IEEE (2013) 150\u2013157"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Joshi, S., Boyd, S.: Sensor selection via convex optimization. Signal Processing, IEEE Transactions on 57(2) (2009) 451\u2013462","DOI":"10.1109\/TSP.2008.2007095"},{"key":"2_CR14","unstructured":"Kelmans, A.K.: On graphs with the maximum number of spanning trees. Random Structures & Algorithms 9(1-2) (1996) 177\u2013192"},{"key":"2_CR15","unstructured":"Kelmans, A.K., Kimelfeld, B.: Multiplicative submodularity of a matrix\u2019s principal minor as a function of the set of its rows and some combinatorial applications. Discrete Mathematics 44(1) (1983) 113\u2013116"},{"key":"2_CR16","unstructured":"Khosoussi, K., Huang, S., Dissanayake, G.: Novel insights into the impact of graph structure on SLAM. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), 2014. (2014) 2707\u20132714"},{"key":"2_CR17","unstructured":"Khosoussi, K., Huang, S., Dissanayake, G.: Good, bad and ugly graphs for SLAM. RSS Workshop on the problem of mobile sensors (2015)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Khosoussi, K., Huang, S., Dissanayake, G.: Tree-connectivity: A metric to evaluate the graphical structure of SLAM problems. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) (2016)","DOI":"10.1109\/ICRA.2016.7487264"},{"key":"2_CR19","unstructured":"Khosoussi, K., Sukhatme, G.S., Huang, S., Dissanayake, G.: Maximizing the weighted number of spanning trees: Near-t-optimal graphs. \narXiv:1604.01116\n\n (2016)"},{"key":"2_CR20","unstructured":"Kim, N., Petingi, L., Schlick, T.: Network theory tools for RNA modeling. WSEAS transactions on mathematics 9(12) (2013) 941"},{"key":"2_CR21","unstructured":"Kretzschmar, H., Stachniss, C., Grisetti, G.: Efficient information-theoretic graph pruning for graph-based slam with laser range finders. In: Intelligent Robots and Systems (IROS), 2011 IEEE\/RSJ International Conference on. (2011) 865 \u2013871"},{"key":"2_CR22","unstructured":"L\u00f6fberg, J.: Yalmip : A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"2_CR23","unstructured":"Myrvold, W.: Reliable network synthesis: Some recent developments. In: Proceedings of International Conference on Graph Theory, Combinatorics, Algorithms, and Applications. (1996)"},{"key":"2_CR24","unstructured":"Nemhauser, G.L.,Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming 14(1) (1978) 265\u2013294"},{"key":"2_CR25","unstructured":"Petingi, L., Rodriguez, J.: A new technique for the characterization of graphs with a maximum number of spanning trees. Discrete mathematics 244(1) (2002) 351\u2013373"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Shamaiah, M., Banerjee, S., Vikalo, H.: Greedy sensor selection: Leveraging submodularity. In: 49th IEEE conference on decision and control (CDC), IEEE (2010) 2572\u20132577","DOI":"10.1109\/CDC.2010.5717225"},{"key":"2_CR27","unstructured":"Shier, D.: Maximizing the number of spanning trees in a graph with n nodes and m edges. Journal Research National Bureau of Standards, Section B 78 (1974) 193\u2013196"},{"key":"2_CR28","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadraticlinear programs using sdpt3. Mathematical programming 95(2) (2003) 189\u2013217"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Vandenberghe, L., Boyd, S., Wu, S.P.: Determinant maximization with linear matrix inequality constraints. SIAM journal on matrix analysis and applications 19(2) (1998) 499\u2013533","DOI":"10.1137\/S0895479896303430"},{"key":"2_CR30","unstructured":"Weichenberg, G., Chan, V.W., M\u00e9dard, M.: High-reliability topological architectures for networks under stress. Selected Areas in Communications, IEEE Journal on 22(9) (2004) 1830\u20131845"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43089-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T16:07:14Z","timestamp":1588781234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43089-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030430887","9783030430894"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43089-4_2","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"value":"2511-1256","type":"print"},{"value":"2511-1264","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}