Sciweavers

3192 search results - page 222 / 639
» The minimum latency problem
Sort
View
EUROSYS
2011
ACM
14 years 9 months ago
Is co-scheduling too expensive for SMP VMs?
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
Orathai Sukwong, Hyong S. Kim
IWPEC
2009
Springer
16 years 4 days ago
An Exponential Time 2-Approximation Algorithm for Bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
Martin Fürer, Serge Gaspers, Shiva Prasad Kas...
190
Voted
APPROX
2004
Springer
180views Algorithms» more  APPROX 2004»
15 years 11 months ago
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
Markus Bläser
CSE
2008
IEEE
15 years 7 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh
145
Voted
CCCG
2010
15 years 7 months ago
Watchman tours for polygons with holes
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
Adrian Dumitrescu, Csaba D. Tóth