Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SPANNING SUBGRAPHAS:
Reports tagged with spanning subgraphas:
TR06-041 | 6th March 2006
Tomas Feder, Rajeev Motwani, An Zhu

k-connected spanning subgraphs of low degree

We consider the problem of finding a $k$-vertex ($k$-edge)
connected spanning subgraph $K$ of a given $n$-vertex graph $G$
while minimizing the maximum degree $d$ in $K$. We give a
polynomial time algorithm for fixed $k$ that achieves an $O(\log
n)$-approximation. The only known previous polynomial algorithms
achieved degree $d+1$ ... more >>>




ISSN 1433-8092 | Imprint