Sciweavers

344 search results - page 24 / 69
» A constant factor approximation algorithm for a class of cla...
Sort
View
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 2 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn
SIAMSC
2008
118views more  SIAMSC 2008»
13 years 8 months ago
Splitting Methods Based on Algebraic Factorization for Fluid-Structure Interaction
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
Santiago Badia, Annalisa Quaini, Alfio Quarteroni
ADHOCNOW
2008
Springer
14 years 2 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
WG
2007
Springer
14 years 2 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 5 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg