Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

NETWORKS
2007

favoriteEmaildiscussreport

109views Computer Networks» more NETWORKS 2007»

Approximability of the k-server disconnection problem

13 years 10 months ago

Approximability of the k-server disconnection problem

Download polytope.snu.ac.kr

Sung-Pil Hong, Byung-Cheon Choi

Real-time Traffic

Computer Networks | NETWORKS 2007 |

claim paper

Related Content

» A polynomialtime approximation scheme for planar multiway cut

» Software Architectural Support for Disconnected Operation in Highly Distributed Environmen...

» Partial Multicuts in Trees

» Constant Ratio FixedParameter Approximation of the Edge Multicut Problem

» Approximation and Hardness Results for Label Cut and Related Problems

» An Improved Approximation Algorithm for Multiway Cut

» The Checkpoint Problem

» The Pattern of Multiple Rings from Morphogenesis in Development

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	NETWORKS
Authors	Sung-Pil Hong, Byung-Cheon Choi

Comments (0)