Sciweavers

CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 1 days ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
ACL
2011
12 years 8 months ago
Word Alignment via Submodular Maximization over Matroids
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
Hui Lin, Jeff Bilmes
ACL
2011
12 years 8 months ago
A Class of Submodular Functions for Document Summarization
We design a class of submodular functions meant for document summarization tasks. These functions each combine two terms, one which encourages the summary to be representative of ...
Hui Lin, Jeff Bilmes
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 1 months ago
Shaping Level Sets with Submodular Functions
We consider a class of sparsity-inducing regularization terms based on submodular functions. While earlier work has focused on non-decreasing functions, we explore symmetric submo...
Francis Bach
FSTTCS
2010
Springer
13 years 2 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 2 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 4 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
FOCS
2007
IEEE
13 years 10 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
FOCS
2008
IEEE
13 years 10 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer