Alexandre Megretski

2001

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 3 researchers here, as inferred from the citation graph.

Whom Alexandre Megretski trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Michel X. Goemans
  2. David P. Williamson
  3. J. Håstad

Who trusts Alexandre Megretski overall

  1. David P. Williamson
  2. Gilles Pisier

Papers from Alexandre Megretski's perspective

Ordered by how strongly the researchers Alexandre Megretski trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  2. Some optimal inapproximability results
  3. Proof verification and hardness of approximation problems
  4. TSPLIB - A Traveling Salesman Problem Library
  5. Reducibility Among Combinatorial Problems
  6. Probabilistic checking of proofs: a new characterization of NP
  7. A threshold of ln n for approximating set cover (preliminary version)
  8. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
  9. Fast approximation algorithms for fractional packing and covering problems
  10. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)

Their papers