Sciweavers

Share
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
8 years 4 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
AAIM
2008
Springer
138views Algorithms» more  AAIM 2008»
8 years 5 months ago
Confidently Cutting a Cake into Approximately Fair Pieces
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
AAIM
2008
Springer
208views Algorithms» more  AAIM 2008»
8 years 5 months ago
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreibe...
AAIM
2008
Springer
131views Algorithms» more  AAIM 2008»
8 years 9 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
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 ...
Zhi-Zhong Chen, Ruka Tanahashi
AAIM
2008
Springer
97views Algorithms» more  AAIM 2008»
8 years 9 months ago
The Distributed Wireless Gathering Problem
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchet...
AAIM
2008
Springer
153views Algorithms» more  AAIM 2008»
8 years 9 months ago
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
Marek Chrobak, Christoph Dürr, Mathilde Huran...
AAIM
2008
Springer
120views Algorithms» more  AAIM 2008»
8 years 9 months ago
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
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...
Gregory Gutin, Arash Rafiey, Anders Yeo
AAIM
2008
Springer
119views Algorithms» more  AAIM 2008»
8 years 9 months ago
Engineering Comparators for Graph Clusterings
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...
Daniel Delling, Marco Gaertler, Robert Görke,...
AAIM
2008
Springer
105views Algorithms» more  AAIM 2008»
8 years 9 months ago
Finding Optimal Refueling Policies in Transportation Networks
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...
Shieu-Hong Lin
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
8 years 9 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
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...
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
books