160 search results - page 10 / 32 » Approximating Maximum Edge 2-Coloring in Simple Graphs |
137
click to vote
JAL
2006
15 years 3 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
162
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
125
click to vote
DAM
2008
15 years 3 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
142
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
112
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...