Authors: Könemann, Jochen, Sinha, Amitabh, Levin, Asaf

Contributors: Business School, University of Michigan, Ann Arbor, MI 48103, USA, Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada, Faculty of Industrial Engineering and Management, The Technion, Haifa 32000, Israel, Ann Arbor

Subject Terms: Computer Science, Bicriteria Approximation, General, Degree-bounded Spanning Trees, Spanning Trees, Approximation Algorithms, Software Engineering/Programming and Operating Systems, Computer Hardware, Computer Systems Organization and Communication Networks, Data Structures, Cryptology and Information Theory, Theory of Computation, Philosophy, Mathematics, Humanities, Science

File Description: 966246 bytes; 3115 bytes; application/pdf; text/plain

Relation: Könemann, Jochen; Levin, Asaf; Sinha, Amitabh; (2004). "Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem." Algorithmica 41(2): 117-129.; https://hdl.handle.net/2027.42/41348; http://dx.doi.org/10.1007/s00453-004-1121-2; Algorithmica

Availability: https://doi.org/10.1007/s00453-004-1121-2
https://hdl.handle.net/2027.42/41348

Authors: Stembridge, John R.

Contributors: Department of Mathematics, University of Michigan, 48109-1109, Ann Arbor, Michigan, USA, Ann Arbor

Subject Terms: Mathematics, Combinatorics, 05A15, 14Q15, 68Q40, Spanning Trees, Matroids, Computational Algebra, Science

Time: 05-04

File Description: 1429827 bytes; 3115 bytes; application/pdf; text/plain

Relation: Stembridge, John R.; (1998). "Counting points on varieties over finite fields related to a conjecture of Kontsevich." Annals of Combinatorics 2(4): 365-385.; http://hdl.handle.net/2027.42/43265; http://dx.doi.org/10.1007/BF01608531; Annals of Combinatorics

Availability: https://doi.org/10.1007/BF01608531
http://hdl.handle.net/2027.42/43265

Authors: Neemuchwala, Huzefa Firoz

Contributors: III, Alfred O. Hero, Carson, Paul L.

Subject Terms: Entropic Graphs, Image Registration, Minimum Spanning Tree, Nearest-neighbor Graphs

File Description: 194 p.; application/pdf

Relation: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3163898; https://hdl.handle.net/2027.42/124899

Availability: https://hdl.handle.net/2027.42/124899
http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3163898