1101 search results - page 40 / 221 » An Algorithm for the Graph Crossing Number Problem |
215
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
185
click to vote
CATS
2006
15 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
175
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
180
click to vote
APIN
2010
15 years 6 months ago
2010
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
173
click to vote
FSTTCS
2007
Springer
16 years 19 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...