AAIM
2008
Springer
14 years 6 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
AAIM
2008
Springer
14 years 6 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...