• Publications
  • Influence
A threshold of ln n for approximating set cover
  • U. Feige
  • Mathematics, Computer Science
  • JACM
  • 1 July 1998
Given a collection<inline-equation><f> <sc>F</sc></f></inline-equation> of subsets of <?Pub Fmt italic>S<?Pub Fmt /italic> ={1,…,<?Pub Fmt italic>n<?Pub Fmt /italic>}, <?Pub Fmt italic>setcover<?PubExpand
  • 2,951
  • 250
Zero-knowledge proofs of identity
TLDR
In this paper we extend the notion of interactive proofs of assertions to Interactive proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever. Expand
  • 1,103
  • 71
  • PDF
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
  • U. Feige, M. Goemans
  • Mathematics, Computer Science
  • Proceedings Third Israel Symposium on the Theory…
  • 4 January 1995
TLDR
We present improved approximation algorithms for MAX 2SAT and MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson. Expand
  • 357
  • 60
  • PDF
Witness indistinguishable and witness hiding protocols
TLDR
A two par ty protocol in which par ty A uses one of several secret witnesses to an assertion is witness indistinguishable if par ty B cannot tell which witness A is actually using. Expand
  • 561
  • 40
  • PDF
The Dense k -Subgraph Problem
TLDR
This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. Expand
  • 527
  • 40
  • PDF
Maximizing Non-monotone Submodular Functions
TLDR
In this paper, we design the first constant-factor approximation algorithms for maximizing nonnegative (non-monotone) submodular functions. Expand
  • 277
  • 36
Relations between average case complexity and approximation complexity
  • U. Feige
  • Mathematics, Computer Science
  • STOC '02
  • 19 May 2002
TLDR
We investigate relations between average case complexity and the complexity of approximation. Expand
  • 257
  • 34
  • PDF
On maximizing welfare when utility functions are subadditive
  • U. Feige
  • Mathematics, Computer Science
  • STOC '06
  • 21 May 2006
TLDR
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Expand
  • 251
  • 31
  • PDF
Zero knowledge and the chromatic number
  • U. Feige, J. Kilian
  • Mathematics, Computer Science
  • Proceedings of Computational Complexity (Formerly…
  • 24 May 1996
TLDR
We present a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph. Expand
  • 244
  • 29
Maximizing Non-Monotone Submodular Functions
TLDR
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems. Expand
  • 231
  • 29
  • PDF