2107 search results - page 64 / 422 » b 2007 |
IPCO
2007
13 years 11 months ago
2007
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
ALGORITHMICA
2004
13 years 9 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
ECSQARU
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we study a new probability associated with any given belief function b, i.e. the orthogonal projection π[b] of b onto the probability simplex P. We provide an interp...
ENDM
2007
13 years 10 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
APAL
2007
13 years 10 months ago
2007
We show that ℵ2 ≤ b < g is consistent. This work is dedicated to James Baumgartner on the occasion of his 60th birthday.