Sciweavers

Share
58 search results - page 1 / 12
» A Deterministic Approximation Algorithm for Maximum 2-Path P...
Sort
View
IEICET
2010
124views more  IEICET 2010»
8 years 10 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
9 years 7 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang
SPAA
2010
ACM
9 years 6 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
9 years 7 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
APPROX
2004
Springer
180views Algorithms» more  APPROX 2004»
9 years 6 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
books