k-balanced binary trees are a form of binary tree balanced by the internal path reduction algorithm described by Gonnet in his original article [1]. As discussed previously in Chapter 3, this balancing scheme reorganizes one or more subtrees whenever the internal path length can be reduced. ...
The algorithm BC is able to solve more instances to optimality than BB+01 and BB+S1S2; many of them in the root of the branch-and-cut tree. For both sets of instances and for each value of k, except for set 3.5 when k=n, the average gap of the non-solved instances is very sma...
K-D binary search treecyclingleaf-blocks/ C4240 Programming and algorithm theory C6160 Database management systems (DBMS)The dissemination of Electronic Health Records (EHRs) can be highly beneficial for a range of medical studies, spanning from clinical trials to epidemic control studies, but it ...