160 search results - page 18 / 32 » Approximating Maximum Edge 2-Coloring in Simple Graphs |
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
DISOPT
2010
13 years 7 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
CIAC
2010
Springer
14 years 5 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...