• Publications
  • Influence
A threshold of ln n for approximating set cover
  • U. Feige
  • Mathematics, Computer Science
  • JACM
  • 1 July 1998
TLDR
It is proved that (1 - <?Pub Fmt italic>o<?Pub FMT /italic>(1) ln n setcover is a threshold below which setcover cannot be approximated efficiently, unless NP has slightlysuperpolynomial time algorithms. Expand
Spectral graph theory
  • U. Feige
  • Zeta and 𝐿-functions in Number Theory and…
  • 2019
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shallExpand
Zero-knowledge proofs of identity
TLDR
This paper defines the definition of unrestricted input zero- knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions). Expand
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
The approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semideFinite programs, as introduced by Goemans and Williamson (SToc94). Expand
Witness indistinguishable and witness hiding protocols
TLDR
This work proves two central results: Unlike zero knowledge protocols, witness indistinguishablity is preserved under arbi t rary composition of protocols, including parallel execution, and any witness indistinguishable protocol for this s ta tement is also. Expand
Maximizing Non-monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed and undirected graphs and hypergraphs, certain constraint satisfaction problems, and maximum facilityExpand
The Dense k -Subgraph Problem
TLDR
An approximation algorithm is developed for the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges, with approximation ratio O(nδ) , for some δ < 1/3 . Expand
Relations between average case complexity and approximation complexity
  • U. Feige
  • Mathematics, Computer Science
  • STOC '02
  • 19 May 2002
TLDR
Under the assumption that refuting 3SAT is hard on average on a natural distribution, hardness of approximation results for min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem are derived. Expand
On maximizing welfare when utility functions are subadditive
  • U. Feige
  • Mathematics, Computer Science
  • STOC '06
  • 21 May 2006
TLDR
A way of rounding any fractional solution to a linear programming relaxation to solve the problem of maximizing welfare so as to give a feasible solution of welfare at least half that of the value of the fractional Solution. Expand
Zero knowledge and the chromatic number
  • U. Feige, J. Kilian
  • Mathematics, Computer Science
  • Proceedings of Computational Complexity (Formerly…
  • 24 May 1996
TLDR
A new technique, inspired by zero-knowledge proof systems, is presented for proving lower bounds on approximating the chromatic number of a graph, and the result matches (up to low order terms) the known gap for approximation the size of the largest independent set. Expand
...
1
2
3
4
5
...