Search

Your search keyword '"depth restriction"' showing total 5 results
Start Over Descriptor "depth restriction"
5 results on '"depth restriction"'

2. Caulerpa bikinensis (Chlorophyta) Preference for the Mesophotic Depths of Pacific Atolls.

Author

Tsuda, Roy T.

Subjects
*CORAL reefs & islands, *CAULERPA, *WATER depth, *HABITAT selection, *LIGHT intensity, *GREEN algae, *MARINE algae
Abstract

The marine green alga Caulerpa bikinensis W. R. Taylor was described as a new species in 1950 from dredged specimens (37-57m depth) from Bikini Atoll and Rongelap Atoll in the Marshall Islands. Its relative rareness in collections from waters less than 30m deep from these atolls indicated that it favored the mesophotic coral ecosystem (MCE) at depths of 30-150m. Published and unpublished records of this species over the past 70 years show its habitat preference on the seaward slopes of atolls and in lagoons. Observations were based on collections from Pacific atolls of the Marshall Islands, Tuamotu Islands, Chuuk State in the Federated States of Micronesia, Cook Islands, and Johnston Atoll, and on the deep lagoonal reefs of Palau. Caulerpa bikinensis has also been recorded in shallow waters 1m deep in dark microcavities on lagoonal pinnacles at Takapoto Atoll (Tuamotu Islands) and in Chuuk Lagoon, and 2m deep at Raroia Atoll (Tuamotu Islands). Caulerpa bikinensis favors the deeper depths of theMCE for its low light intensity rather than its cooler temperature, and definitely shows a strong affinity to the high energy seaward slopes of calcareous Pacific atolls. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

4. Approximating k-hop Minimum Spanning Trees in Euclidean metrics

Author

Laue, Soeren and Matijević, Domagoj

Subjects
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, approximation algorithms, minimum spanning trees, depth restriction, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

In the minimum-cost $k$-hop spanning tree ($k$-hop MST) problem, we are given a set $S$ of $n$ points in a metric space, a positive small integer $k$ and a root point $r\in S$. We are interested in computing a rooted spanning tree of minimum cost such that the longest root-leaf path in the tree has at most $k$ edges. We present a polynomial- time approximation scheme for the plane. Our algorithms is based on Arora's at el. techniques for the Euclidean $k$-median problem.

Published
2008

5. Approximating $k$-hop minimum-spanning trees

Author

Martin Skutella, Ernst Althaus, Edgar A. Ramos, Jochen Könemann, Stefan Funke, Sariel Har-Peled, Computational models in molecular biology (MODBIO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, University of Illinois at Urbana-Champaign [Urbana], University of Illinois System, Department of Combinatorics and Optimization, University of Waterloo [Waterloo], This work was supported in part by the IST Program of the EU under contract numbers IST-1999-14186 (ALCOM-FT) and IST-2001-30012 (APPOL II)., and Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)

Subjects
K-ary tree, 0102 computer and information sciences, 02 engineering and technology, Management Science and Operations Research, Minimum spanning tree, k-minimum spanning tree, 01 natural sciences, Industrial and Manufacturing Engineering, Combinatorics, Distributed minimum spanning tree, Minimum spanning trees, Kruskal's algorithm, Euclidean minimum spanning tree, 0202 electrical engineering, electronic engineering, information engineering, Depth restriction, Mathematics, Metric space approximation, Spanning tree, Applied Mathematics, Shortest-path tree, 020206 networking & telecommunications, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Approximation algorithms, 010201 computation theory & mathematics, Software, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

http://www.sciencedirect.com; Given a complete graph on~$n$ nodes with metric edge costs, the minimum-cost k-hop spanning tree ($k$HMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most $k$ edges. We present an algorithm that computes such a tree of total expected cost $O(log n)$ times that of a minimum-cost $k$-hop spanning-tree.

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results