Results 1  10
of
49
Maximizing nonmonotone submodular functions
 In Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS
, 2007
"... Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular fu ..."
Abstract

Cited by 94 (13 self)
 Add to MetaCart
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular functions is NPhard. In this paper, we design the first constantfactor approximation algorithms for maximizing nonnegative submodular functions. In particular, we give a deterministic local search 1 2approximation and a randomizedapproximation algo
Connected Rigidity Matroids and Unique Realizations of Graphs
, 2004
"... A ddimensional framework is a straight line realization of a graph G in R d. We shall only consider generic frameworks, in which the coordinates of all the vertices of G are algebraically independent. Two frameworks for G are equivalent if corresponding edges in the two frameworks have the same le ..."
Abstract

Cited by 63 (10 self)
 Add to MetaCart
A ddimensional framework is a straight line realization of a graph G in R d. We shall only consider generic frameworks, in which the coordinates of all the vertices of G are algebraically independent. Two frameworks for G are equivalent if corresponding edges in the two frameworks have the same length. A framework is a unique realization of G in R d if every equivalent framework can be obtained from it by an isometry of R d. Bruce Hendrickson proved that if G has a unique realization in R d then G is (d + 1)connected and redundantly rigid. He conjectured that every realization of a (d + 1)connected and redundantly rigid graph in R d is unique. This conjecture is true for d = 1 but was disproved by Robert Connelly for d ≥ 3. We resolve the remaining open case by showing that Hendrickson’s conjecture is true for d = 2. As a corollary we deduce that every realization of a 6connected graph as a 2dimensional generic framework is a unique realization. Our proof is based on a new inductive characterization of 3connected graphs whose rigidity matroid is connected.
Beyond VCG: Frugality of truthful mechanisms
 In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
, 2005
"... We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the field of mechanism design, we assume that the agents are selfish and will act in such a way as to maximize their profit, wh ..."
Abstract

Cited by 46 (3 self)
 Add to MetaCart
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the field of mechanism design, we assume that the agents are selfish and will act in such a way as to maximize their profit, which in particular may include misrepresenting their true incurred cost. Our first contribution is a new and natural definition of the frugality ratio of a mechanism, measuring the amount by which a mechanism “overpays”, and extending previous definitions to all monopolyfree set systems. After reexamining several known results in light of this new definition, we proceed to study in detail shortest path auctions and “routofk sets ” auctions. We show that when individual set systems (e.g., graphs) are considered instead of worst cases over all instances, these problems exhibit a rich structure, and the performance of mechanisms may be vastly different. In particular, we show that the wellknown VCG mechanism may be far from optimal in these settings, and we propose and analyze a mechanism that is always within a constant factor of optimal. 1
Submodular Maximization Over Multiple Matroids via Generalized Exchange Properties
, 2009
"... Submodularfunction maximization is a central problem in combinatorial optimization, generalizing many important NPhard problems including Max Cut in digraphs, graphs and hypergraphs, certain constraint satisfaction problems, maximumentropy sampling, and maximum facilitylocation problems. Our mai ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
Submodularfunction maximization is a central problem in combinatorial optimization, generalizing many important NPhard problems including Max Cut in digraphs, graphs and hypergraphs, certain constraint satisfaction problems, maximumentropy sampling, and maximum facilitylocation problems. Our main result is that for any k ≥ 2 and any ε> 0, there is a natural localsearch algorithm which has approximation guarantee of 1/(k + ε) for the problem of maximizing a monotone submodular function subject to k matroid constraints. This improves a 1/(k + 1)approximation of Nemhauser, Wolsey and Fisher, obtained more than 30 years ago. Also, our analysis can be applied to the problem of maximizing a linear objective function and even a general nonmonotone submodular function subject to k matroid constraints. We show that in these cases the approximation guarantees of our algorithms are 1/(k − 1 + ε) and 1/(k + 1 + 1/k + ε), respectively.
Nonmonotone submodular maximization under matroid and knapsack constraints
 In Proc. 41th ACM Symp. on Theory of Computing
, 2009
"... Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Un ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NPhard. In this paper, we give the first constantfactor approximation algorithm for maximizing any nonnegative submodular function subject to multiple matroid or knapsack constraints. We emphasize that our results are for nonmonotone submodular functions. In particular, for any constant k, we present a 1 k+2+ 1 k +ǫapproximation for the submodular maximization problem under k matroid constraints, 1 k+ǫ and a ( 1 5 − ǫ)approximation algorithm for this problem subject to k knapsack constraints (ǫ> 0 is 1 any constant). We improve the approximation guarantee of our algorithm to k+1+ 1 for k ≥ 2 k−1 +ǫ partition matroid constraints. This idea also gives aapproximation for maximizing a monotone submodular function subject to k ≥ 2 partition matroids, which improves over the previously best known guarantee of
On secret sharing schemes, matroids and polymatroids
 Journal of Mathematical Cryptology
"... The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the co ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the connections of this open problem with matroids and polymatroids. Matroid ports were introduced by Lehman in 1964. A forbidden minor characterization of matroid ports was given by Seymour in 1976. These results are previous to the invention of secret sharing by Shamir in 1979. Important connections between ideal secret sharing schemes and matroids were discovered by Brickell and Davenport in 1991. Their results can be restated as follows: every ideal secret sharing scheme defines a matroid, and its access structure is a port of that matroid. In spite of this, the results by Lehman and Seymour and other subsequent results on matroid ports have not been noticed until now by the researchers interested in secret sharing. Lower bounds on the optimal complexity of access structures can be found by taking into account that the joint Shannon entropies of a set of random variables define a polymatroid.
On Codes, Matroids and Secure MultiParty Computation from Linear Secret Sharing Schemes
 In Proceedings of CRYPTO 2005, volume 3621 of LNCS
, 2004
"... Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids and a special class of secret sharing schemes, namely multiplicative linear secret sharing schemes (LSSSs). Such schemes are k ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids and a special class of secret sharing schemes, namely multiplicative linear secret sharing schemes (LSSSs). Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.
Graphs of bounded rankwidth
 Princeton University
, 2005
"... We define rankwidth of graphs to investigate cliquewidth. Rankwidth is a complexity measure of decomposing a graph in a kind of treestructure, called a rankdecomposition. We show that graphs have bounded rankwidth if and only if they have bounded cliquewidth. It is unknown how to recognize g ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We define rankwidth of graphs to investigate cliquewidth. Rankwidth is a complexity measure of decomposing a graph in a kind of treestructure, called a rankdecomposition. We show that graphs have bounded rankwidth if and only if they have bounded cliquewidth. It is unknown how to recognize graphs of cliquewidth at most k for fixed k> 3 in polynomial time. However, we find an algorithm recognizing graphs of rankwidth at most k, by combining following three ingredients. First, we construct a polynomialtime algorithm, for fixed k, that confirms rankwidth is larger than k or outputs a rankdecomposition of width at most f(k) for some function f. It was known that many hard graph problems have polynomialtime algorithms for graphs of bounded cliquewidth, however, requiring a given decomposition corresponding to cliquewidth (kexpression); we remove this requirement. Second, we define graph vertexminors which generalizes matroid minors, and prove that if {G1, G2,...} is an infinite sequence of graphs of bounded rankwidth,
Modes and cuts in metabolic networks: Complexity and algorithms
 BioSystems
"... Constraintbased approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steadystate and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Constraintbased approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steadystate and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. A central concept in this methodology is the notion of an elementary mode (EM for short). The computation of EMs still forms a limiting step in metabolic studies and several algorithms have been proposed to address this problem leading to increasingly faster methods. However, although a theoretical upper bound on the number of elementary modes that a network may possess has been established, surprisingly, the complexity of this problem has never been systematically studied. In this paper, we give a systematic overview of the complexity of optimisation problems related to modes. We first establish results regarding network consistency. Most consistency problems are easy, i.e., they can be solved in polynomial time. We then establish the complexity of finding and counting elementary modes. We show in particular that finding one elementary mode is easy but that this task becomes hard when a specific EM (i.e. an EM containing some specified reactions) is sought. We then show that counting the number of elementary modes is ♯Pcomplete. We emphasize that the easy