Sciweavers

Share
WINET
2010
159views more  WINET 2010»
8 years 4 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeef´Čücient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
IPL
2002
89views more  IPL 2002»
8 years 5 months ago
New bounds on the barycenter heuristic for bipartite graph drawing
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
Xiao Yu Li, Matthias F. M. Stallmann
JDA
2006
90views more  JDA 2006»
8 years 6 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
8 years 7 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
STRINGOLOGY
2004
8 years 7 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
VLDB
1994
ACM
153views Database» more  VLDB 1994»
8 years 10 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
8 years 10 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
books