Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
A conversational recommender system iteratively shows a small set of options for its user to choose between. In order to select these options, the system may analyze the queries tr...
Walid Trabelsi, Nic Wilson, Derek G. Bridge, Franc...
Learning genetic representation has been shown to be a useful tool in evolutionary computation. It can reduce the time required to find solutions and it allows the search process ...
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...