V. Chvátal

Publications147
h-index50
Citations16,309
Highly Influential Citations1,424
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • P. Erdös
  • 970 Publications • 38,540 Citations
  • W. Cook
  • 99 Publications • 10,090 Citations
  • M. Grötschel
  • 190 Publications • 13,768 Citations
  • M. Padberg
  • 99 Publications • 9,431 Citations
  • Publications
  • Influence
A Greedy Heuristic for the Set-Covering Problem
TLDR
It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.
The Traveling Salesman Problem: A Computational Study
TLDR
Open Library features a library with books from the Internet Archive and lists them in the open library and gives you access to over 1 million free e-Books and the ability to search using subject, title and author.
On certain polytopes associated with graphs
A note on Hamiltonian circuits
A method in graph theory
Tough graphs and hamiltonian circuits
Biased Positional Games
Solution of a Large-Scale Traveling-Salesman Problem
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled” [6]: Arrow, Bellman, Dantzig, Flood, Ford,…
Edmonds polytopes and a hierarchy of combinatorial problems
Mick gets some (the odds are on his side) (satisfiability)
TLDR
The authors present a linear-time algorithm that satisfies F with probability 1-o(1) whenever c<(0.25)2/sup k//k and establish a threshold for 2-SAT: if k = 2 then F is satisfiable with probability1-o (1) Whenever c<1 and unsatisfiable with probabilities 1-O(1), whenever c>1.
...
1
2
3
4
5
...