Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
A Greedy Heuristic for the Set-Covering Problem
- V. Chvátal
- Mathematics, Computer Science
- Math. Oper. Res.
- 1 August 1979
TLDR
The Traveling Salesman Problem: A Computational Study
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer Science
- 4 February 2007
TLDR
A note on Hamiltonian circuits
- V. Chvátal, P. Erdös
- Computer Science, Mathematics
- Discret. Math.
- 1 May 1972
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
A method in graph theory
- J. A. Bondy, V. Chvátal
- Computer Science, Mathematics
- Discret. Math.
- 1976
TLDR
Biased Positional Games
- V. Chvátal, P. Erdös
- Mathematics
- 1978
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 one… Expand
Edmonds polytopes and a hierarchy of combinatorial problems
- V. Chvátal
- Computer Science, Mathematics
- Discret. Math.
- 1 April 1973
TLDR
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
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer Science
- 15 January 2007
TLDR
- 495
- 40
Tough graphs and hamiltonian circuits
- V. Chvátal
- Computer Science, Mathematics
- Discret. Math.
- 1 July 1973
TLDR