84 search results - page 7 / 17 » Maximum Betweenness Centrality: Approximability and Tractabl... |
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We study a deployment strategy for a group of vehicles that drift in an ambient flow field. Specifically, we address the case where the flow is always greater in magnitude than an ...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
MP
2006
14 years 9 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
BICOB
2009
Springer
15 years 4 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...