7129 search results - page 263 / 1426 » Approximation Algorithms for Treewidth |
141
click to vote
IPL
2006
15 years 4 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
136
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
146
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
143
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
122
click to vote
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...