Butenko Sergiy

Sergiy Butenko

Information about the author Sergiy Butenko will soon be added to the site.
Found 12 papers in total
Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d -degenerate graphs
Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d -degenerate graphs
2014
We describe an algorithm for the maximum clique problem that is parameterized by the...
On provably best construction heuristics for hard combinatorial optimization problems
On provably best construction heuristics for hard combinatorial optimization problems
2016
In this article, a heuristic is said to be provably best if, assuming P N P , no other...
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
2013
Given a simple undirected graph, the problem of finding a maximum subset of vertices...
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
2013
This paper studies the sum‐of‐ratios version of the classical minimum...
Computational study of the US stock market evolution: a rank correlation‐based network model
Computational study of the US stock market evolution: a rank correlation‐based network model
2013
This paper presents a computational study of global characteristics of the US stock...
On clique relaxation models in network analysis
On clique relaxation models in network analysis
2013
Increasing interest in studying community structures , or clusters in complex networks...
A distributed approximation algorithm for the bottleneck connected dominating set problem
A distributed approximation algorithm for the bottleneck connected dominating set problem
2012
Some of the most popular routing protocols for wireless sensor networks require a...
On connected domination in unit ball graphs
On connected domination in unit ball graphs
2011
Given a simple undirected graph, the minimum connected dominating set problem is to...
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
2011
This paper introduces and studies the maximum k‐plex problem , which arises in...
Using critical sets to solve the maximum independent set problem
Using critical sets to solve the maximum independent set problem
2007
A method that utilizes the polynomially solvable critical independent set problem for...
Mining market data: A network approach
Mining market data: A network approach
2006
We consider a network representation of the stock market data referred to as the...
Optimal security liquidation algorithms
Optimal security liquidation algorithms
2005
This paper develops trading strategies for liquidation of a financial security, which...
Papers per page: