Belma Yelbay

Learn More
This paper investigates the role of dual information on the performances of heuristics designed for solving the set covering problem. After solving the linear programming relaxation of the problem, the dual information is used to obtain the two main approaches proposed here: (i) The size of the original problem is reduced and then the resulting model is(More)
As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization. Due to the apparent absence of a common representation model, it is difficult to make a focused effort toward developing access(More)
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs. The problem, which is referred to as the minimum hub cover problem, has recently been introduced to the literature to improve query processing over large graph databases. Planar graphs also arise in various graph query processing(More)
Understanding gene regulation by identifying gene products and determining their roles in regulatory networks is a complex process. A common computational method is to reverse engineer a regulatory network from gene expression profile, and sanitize the network using known information about the genes, their interactions and other properties to filter out(More)
The minimum hub cover is a new NP-hard optimization problem that has been recently introduced to the literature in the context of graph query processing. Although a standard set covering formulation has been given, alternate models have not been studied before. This paper fills in that gap and proposes several new mathematical programming models. We give(More)
  • 1