• Publications
  • Influence
A Greedy Heuristic for the Set-Covering Problem
  • V. Chvátal
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1 August 1979
TLDR
Let A be a binary matrix of size m × n, let cT be a positive row vector of length n and let e be the column vector, all of whose m components are ones. Expand
  • 2,444
  • 194
The Traveling Salesman Problem: A Computational Study
TLDR
As the name suggests, Open Library features a library with books from the Internet Archive and lists them in the open library. Expand
  • 1,251
  • 122
  • PDF
On certain polytopes associated with graphs
  • 557
  • 58
A note on Hamiltonian circuits
Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected,Expand
  • 516
  • 54
  • PDF
A method in graph theory
TLDR
A unified approach to a variety of graph-theoretic problems is introduced. Expand
  • 355
  • 52
Biased Positional Games
Two players play a game on the complete graph with n vertices. Each move of the first player consists of claiming k previously unclaimed edges, each move of the second player consists of claiming oneExpand
  • 143
  • 51
  • PDF
Edmonds polytopes and a hierarchy of combinatorial problems
  • V. Chvátal
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 April 1973
TLDR
We prove that there is no upper bound on the rank of problems arising from the search for largest independent sets in graphs. Expand
  • 592
  • 47
Mick gets some (the odds are on his side) (satisfiability)
  • V. Chvátal, B. Reed
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on…
  • 24 October 1992
TLDR
Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is fixed at any value greater than 1, but n tends to infinity and m = (1 + o(1))cn for some c depending only on k. Expand
  • 357
  • 41
  • PDF
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
TLDR
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem, a problem that has inspired studies by mathematicians, chemists, and physicists. Expand
  • 495
  • 40
Tough graphs and hamiltonian circuits
  • V. Chvátal
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 July 1973
TLDR
The toughness of a graph G is defined as the largest real number t such that deletion of any s points from G results in a graph which is either connected or else has at most s/t components. Expand
  • 373
  • 40
  • PDF