2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2008
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
G. Hickey, P. Carmi, A. Maheshwari +1
The Noah's Ark Problem (NAP) is an NP-Hard optimization problem with relevance to ecological conservation management. It asks to maximize the phylogenetic diversity (PD) of a set o…
cs.CG2007★ 2 cited
Geometric Spanners With Small Chromatic Number
Prosenjit Bose, Paz Carmi, Mathieu Couture +3
Given an integer , we consider the problem of computing the smallest real number such that for each set of points in the plane, there exists a -spanner f…