350 search results - page 41 / 70 » Lower bounds and heuristic algorithms for the k |
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
94
Voted
SODA
2012
ACM
13 years 3 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
77
Voted
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
STOC
1991
ACM
15 years 1 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...