On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees

被引：0

作者：

Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, United States ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 123-137期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] Decision problems with uncertainty: A convex optimization approach
El Ghaoui, L
SYSTEM STRUCTURE AND CONTROL 1997, 1998, : 55 - 61
[22] 3-DIMENSIONAL CONVEX PARTICLES AT INTERFACES
WILLIAMS, DRM
RAPHAEL, E
JOURNAL OF COLLOID AND INTERFACE SCIENCE, 1993, 155 (02) : 509 - 511
[23] Convex hulls in a 3-dimensional space
Kovalevsky, Vladimir
Schulz, Henrik
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3322 : 176 - 196
[24] Convex hulls in a 3-dimensional space
Kovalevsky, V
Schulz, H
COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 176 - 196
[25] OPTIMAL PARALLEL RANDOMIZED ALGORITHMS FOR 3-DIMENSIONAL CONVEX HULLS AND RELATED PROBLEMS
REIF, JH
SEN, S
SIAM JOURNAL ON COMPUTING, 1992, 21 (03) : 466 - 485
[26] On the Computational Complexity of Optimization Convex Covering Problems of Graphs
Buzatu, Radu
COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2020, 28 (02) : 187 - 200
[27] 3-DIMENSIONAL SEGMENTATION OF BRONCHIAL TREES
WOOD, SA
HOFORD, JD
HOFFMAN, EA
BROWN, RH
MITZNER, W
FASEB JOURNAL, 1992, 6 (05): : A1624 - A1624
[28] FINDING SADDLE POINTS ON CONVEX POLYHEDRA IN MINIMAX OPTIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS
BELENKII, AS
AUTOMATION AND REMOTE CONTROL, 1980, 41 (07) : 1017 - 1022
[29] THE COMPLEXITY OF CELLS IN 3-DIMENSIONAL ARRANGEMENTS
EDELSBRUNNER, H
HAUSSLER, D
DISCRETE MATHEMATICS, 1986, 60 : 139 - 146
[30] COMPLEXITY THEORY OF 3-DIMENSIONAL MANIFOLDS
MATVEEV, SV
ACTA APPLICANDAE MATHEMATICAE, 1990, 19 (02) : 101 - 130

← 1 2 3 4 5 →