5 search results - page 1 / 1 » Computability of Width of Submodular Partition Functions |
113
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
154
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
134
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
141
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
160
click to vote
AAAI
2010
15 years 5 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...