2137 search results - page 102 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
INFORMS
2008
15 years 2 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
IPL
2008
15 years 2 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
140
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
129
click to vote
NIPS
2004
15 years 3 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
165
Voted
COCOON
2010
Springer
15 years 26 days ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...