51 search results - page 4 / 11 » Constructive Upper Bounds for Cycle-Saturated Graphs of Mini... |
STOC
1999
ACM
13 years 10 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
STOC
1997
ACM
13 years 10 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
FOCS
2009
IEEE
14 years 15 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
ACSC
2005
IEEE
13 years 11 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
DCOSS
2008
Springer
13 years 7 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...