252 search results - page 5 / 51 » Decremental Clique Problem |
NETWORKS
2008
14 years 9 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
HEURISTICS
2006
14 years 9 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a novel technique to deal with sudden bandwidth changes in TCP. In the current Internet, sudden bandwidth changes may occur due to vertical handovers ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
84
Voted
LION
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...