Authors: Anonymous
Subject Terms: Discrete-Time Markov Chain, Minimum Spanning Tree, Unsupervised Learning, Community Detection Algorithms
Relation: https://dx.doi.org/10.5281/zenodo.8226703; https://dx.doi.org/10.5281/zenodo.10674508; https://dx.doi.org/10.5281/zenodo.10674537
Authors: Anonymous
Authors: Anonymous
Authors: Gargano, Luisa, Rescigno, Adele A.
Subject Terms: Spanning Trees, Branch vertices, Fixed-parameter tractable algorithms, Modular-width, Theory of computation → Parameterized complexity and exact algorithms, Mathematics of computing → Graph theory
File Description: application/pdf
Authors: Fotakis, Dimitris, Gergatsouli, Evangelia, Pipis, Charilaos, Stouras, Miltiadis, Tzamos, Christos
Subject Terms: algorithms under uncertainty, graph connectivity, spanning tree, noisy queries, online algorithms, stochastic optimization, Theory of computation → Design and analysis of algorithms
File Description: application/pdf
Relation: https://proceedings.neurips.cc/paper/2020/hash/62da5a6d47be0029801ba74a17e47e1a-Abstract.html; https://proceedings.neurips.cc/paper/2017/file/db5cea26ca37aa09e5365f3e7f5dd9eb-Paper.pdf; https://proceedings.neurips.cc/paper/2015/hash/3416a75f4cea9109507cacd8e2f2aefc-Abstract.html; https://dx.doi.org/10.4230/LIPIcs.MFCS.2023; https://dx.doi.org/10.1007/978-3-319-12340-0_14; https://dx.doi.org/10.1137/S0097539791195877; https://dx.doi.org/10.1109/TNET.2017.2725905; https://dx.doi.org/10.1145/2632951.2632990; https://dx.doi.org/10.4230/LIPIcs.STACS.2008.1358; https://dx.doi.org/10.4153/CJM-1970-125-1; https://dx.doi.org/10.3390/s21217254; https://dx.doi.org/10.1109/CVPR.2009.5206863
Authors: Chen, Yu, Khanna, Sanjeev, Tan, Zihan
Subject Terms: Minimum spanning tree, travelling salesman problem, streaming algorithms, Theory of computation → Design and analysis of algorithms
File Description: application/pdf
Authors: Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro
Subject Terms: combinatorial reconfiguration, spanning trees, PSPACE, polynomial-time algorithms, Mathematics of computing → Graph algorithms
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.STACS.2022; https://dx.doi.org/10.4230/LIPIcs.ESA.2020.24; https://dx.doi.org/10.1137/120864271; https://dx.doi.org/10.1006/jagm.1994.1042; https://dx.doi.org/10.1109/FOCS.2006.48; https://dx.doi.org/10.1016/S0166-218X(03)00360-3; https://dx.doi.org/10.1016/0020-0190(94)00183-Y; https://dx.doi.org/10.1016/j.tcs.2005.05.008; https://dx.doi.org/10.1017/CBO9781139506748.005; https://dx.doi.org/10.1145/2723372.2723717; https://dx.doi.org/10.1007/PL00009225; https://dx.doi.org/10.1016/j.tcs.2010.12.005; https://dx.doi.org/10.4230/LIPIcs.MFCS.2019.79; https://dx.doi.org/10.3390/a11040052; https://dx.doi.org/10.1145/2629366; https://dx.doi.org/10.1007/s00453-003-1056-z
Availability: https://doi.org/10.4230/lipics.stacs.2022.1510.4230/LIPIcs.STACS.202210.4230/LIPIcs.ESA.2020.2410.1137/12086427110.1006/jagm.1994.104210.1109/FOCS.2006.4810.1016/S0166-218X(03)00360-310.1016/0020-0190(94)00183-Y10.1016/j.tcs.2005.05.00810.1017/CBO9781139506748.00510.1145/2723372.272371710.1007/PL0000922510.1016/j.tcs.2010.12.00510.4230/LIPIcs.MFCS.2019.7910.3390/a1104005210.1145/262936610.1007/s00453-003-1056-z
Authors: Biniaz, Ahmad, Daliri, Majid, Moradpour, Amir Hossein
Subject Terms: Euclidean spanning trees, approximation algorithms, bounded-angle visibility, Theory of computation → Computational geometry, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
Authors: Ghosh, Anirban, Shariful, FNU, Wisnosky, David
Subject Terms: well-separated pair decomposition, nearest neighbor, geometric spanners, minimum spanning tree, Theory of computation → Computational geometry
File Description: application/pdf
Authors: Aichholzer, Oswin, Obenaus, Johannes, Orthaber, Joachim, Paul, Rosna, Schnider, Patrick, Steiner, Raphael, Taubner, Tim, Vogtenhuber, Birgit
Subject Terms: edge partition, complete geometric graph, plane spanning tree, wheel set, Mathematics of computing → Combinatorics, Mathematics of computing → Graph theory
File Description: application/pdf
Relation: https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2022/#problem-description; http://www.openproblemgarden.org/op/partition_of_complete_geometric_graph_into_plane_trees; https://dx.doi.org/10.4230/LIPIcs.SoCG.2022; https://dx.doi.org/10.1016/j.comgeo.2019.04.001; https://dx.doi.org/10.1016/0095-8956(79)90021-2; https://dx.doi.org/10.1016/j.comgeo.2020.101653; https://dx.doi.org/10.1016/j.comgeo.2005.08.006; https://dx.doi.org/10.1016/j.jctb.2013.11.001
Availability: https://doi.org/10.4230/lipics.socg.2022.610.4230/LIPIcs.SoCG.202210.1016/j.comgeo.2019.04.00110.1016/0095-8956(79)90021-210.1016/j.comgeo.2020.10165310.1016/j.comgeo.2005.08.00610.1016/j.jctb.2013.11.001
Subject Terms: geometric network design, spanning trees, plane straight-line graphs, approximation algorithms, Theory of computation → Routing and network design problems, Theory of computation → Approximation algorithms analysis, Theory of computation → Computational geometry, Mathematics of computing → Trees
File Description: application/pdf
Relation: http://www.springerlink.com/index/10.1007/s00454-004-1117-3; http://mitpress.mit.edu/books/introduction-algorithms; https://dx.doi.org/10.4230/LIPIcs.SoCG.2022; https://dx.doi.org/10.3233/FI-1995-2245; https://dx.doi.org/10.1007/978-3-642-12200-2_40; https://dx.doi.org/10.1145/290179.290180; https://dx.doi.org/10.1007/s00453-004-1103-4; https://dx.doi.org/10.1145/876638.876640; https://dx.doi.org/10.1137/1.9781611975994.50; https://dx.doi.org/10.1007/s00453-018-0482-x; https://dx.doi.org/10.1109/SFCS.1991.185434; https://dx.doi.org/10.1007/978-3-540-27798-9_8; https://dx.doi.org/10.1007/978-3-540-77974-2; https://dx.doi.org/10.1007/s00454-010-9277-9; https://dx.doi.org/10.1007/s00453-001-0016-8
Authors: Wang, Haitao, Zhao, Yiming
Subject Terms: minimum spanning tree, moving points, unit-disk range emptiness query, dynamic data structure, Theory of computation → Computational geometry, Theory of computation → Design and analysis of algorithms
File Description: application/pdf
Subject Terms: Spanning Tree Polynomial, Monotone Computation, Lower Bounds, Communication Complexity, Theory of computation → Algebraic complexity theory
File Description: application/pdf
Relation: http://dl.acm.org/citation.cfm?id=314161.314429; http://www.jstor.org/stable/3062153; https://eccc.weizmann.ac.il/report/2019/032; https://dx.doi.org/10.4230/LIPIcs.ITCS.2022; https://dx.doi.org/10.1007/978-3-030-61792-9_25; https://dx.doi.org/10.1145/3406325.3451069; https://dx.doi.org/10.1137/0217015; https://dx.doi.org/10.1007/s00037-020-00196-6; https://dx.doi.org/10.4230/LIPIcs.CCC.2021.9; https://dx.doi.org/10.1145/322326.322341; https://dx.doi.org/10.1016/j.jcss.2010.06.013; https://dx.doi.org/10.1145/3417758; https://dx.doi.org/10.1145/3313276.3316311
Authors: Merino, Arturo, Mütze, Torsten, Williams, Aaron
Subject Terms: Matroids, base exchange, Gray codes, combinatorial generation, greedy algorithms, spanning trees, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Combinatorics, Mathematics of computing → Combinatorial algorithms
File Description: application/pdf
Relation: https://gitlab.com/amerinof/greedy-matroids; www.newgrounds.com/portal/view/11940; http://www.combos.org/; villains.fandom.com/wiki/CATS; knowyourmeme.com/memes/all-your-base-are-belong-to-us; https://legendsoflocalization.com/lets-take-a-peek-at-zero-wings-all-your-base-translation/; en.wikipedia.org/wiki/All_your_base_are_belong_to_us; en.wikipedia.org/wiki/Zero_Wing; https://dx.doi.org/10.4230/LIPIcs.FUN.2022
Authors: Padalkin, Andreas, Scheideler, Christian, Warner, Daniel
Subject Terms: progammable matter, amoebot model, reconfigurable circuits, spanning tree, symmetry detection, Theory of computation → Distributed computing models, Theory of computation → Computational geometry
File Description: application/pdf
Subject Terms: Asynchronous networks, Minimum Spanning Tree, Distributed Algorithm, Singularly Optimal, Theory of computation → Distributed algorithms, Mathematics of computing → Probabilistic algorithms, Mathematics of computing → Discrete mathematics
File Description: application/pdf
Relation: http://www.cambridge.org/gb/knowledge/isbn/item2327542/; https://dx.doi.org/10.4230/LIPIcs.DISC.2022; https://dx.doi.org/10.1145/3212734.3212774; https://dx.doi.org/10.1145/3382734.3405713; https://dx.doi.org/10.1145/2933057.2933121; https://dx.doi.org/10.1145/2486159.2486180; https://dx.doi.org/10.1007/s004460050033
Authors: Biniaz, Ahmad
Subject Terms: Euclidean maximum spanning tree, spanning tree with neighborhoods, approximation algorithms, Theory of computation → Computational geometry, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
Authors: Chekuri, Chandra, Quanrud, Kent, Torres, Manuel R.
Subject Terms: bounded degree spanning tree, crossing spanning tree, swap rounding, fast approximation algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Graph algorithms analysis
File Description: application/pdf
Relation: https://www.ideals.illinois.edu/handle/2142/106153; http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-126.html; https://dx.doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021; https://dx.doi.org/10.1137/080734340; https://dx.doi.org/10.1007/s00453-007-9115-5; https://dx.doi.org/10.1006/jagm.1994.1042; https://dx.doi.org/10.1109/focs.2006.48
Authors: Buchheim, Christoph, Henke, Dorothee, Hommelsheim, Felix
Subject Terms: Approximation algorithms, Bilevel optimization, Combinatorial optimization, Complexity, Spanning tree problem, Steiner tree
Time: 510