Search Sciweavers | Sciweavers

780 search results - page 6 / 156

» Cost-Sharing Approximations for h

click to vote

PODC
2012
ACM

215views Distributed and Parallel Com...» more PODC 2012»

Iterative approximate byzantine consensus in arbitrary directed graphs

11 years 9 months ago

Download www.crhc.illinois.edu

This paper proves a necessary and suﬃcient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...

Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang

claim paper

Read More »

click to vote

CORR
2008
Springer

169views Education» more CORR 2008»

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

13 years 6 months ago

Download www.cse.cuhk.edu.hk

For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...

Mingyu Xiao, Leizhen Cai, Andrew C. Yao

claim paper

Read More »

click to vote

ICCAD
1999
IEEE

57views Hardware» more ICCAD 1999»

Least fixpoint approximations for reachability analysis

13 years 11 months ago

Download vlsi.colorado.edu

In-Ho Moon, James H. Kukula, Thomas R. Shiple, Fab...

claim paper

Read More »