WorldCat Identities

Chvátal, Vašek 1946-

Overview
Works: 39 works in 98 publications in 2 languages and 2,300 library holdings
Genres: Conference proceedings 
Roles: Creator
Classifications: QA164 .T72 2011, 511.5
Publication Timeline
Key
Publications about  Vašek Chvátal Publications about Vašek Chvátal
Publications by  Vašek Chvátal Publications by Vašek Chvátal
Most widely held works about Vašek Chvátal
 
Most widely held works by Vašek Chvátal
Linear programming by Vašek Chvátal ( Book )
16 editions published between 1983 and 2003 in English and Undetermined and held by 808 WorldCat member libraries worldwide
The Traveling Salesman Problem a Computational Study by David L Applegate ( )
3 editions published between 2006 and 2011 in English and held by 795 WorldCat member libraries worldwide
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho
Topics on perfect graphs by V Chvtal ( Book )
8 editions published in 1984 in English and held by 366 WorldCat member libraries worldwide
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results
Combinatorial Optimization by V Chvátal ( )
7 editions published in 2011 in English and held by 230 WorldCat member libraries worldwide
This book is a collection of six articles arising from the meeting of the NATO Advanced Study Institute (ASI) "Combinatorial Optimization: Methods and Applications", which was held at the University of Montreal in June 2006. This ASI consisted of seven series of five one-hour lectures and one series of four one-hour lectures. It was attended by some sixty students of graduate or postdoctoral level from fifteen countries worldwide. Topics include: integer and mixed integer programming, facility location, branching on split disjunctions, convexity in combinatorial optimization, and VLSI design. Although drawn from the 2006 lecture series, the articles included in this volume were all either written or updated by the authors in 2010, so that this collection of papers reflects a state-of-the-art overview of combinatorial optimization methods and their applications
Recognizing dart-free perfect graphs by Vašek Chvátal ( Book )
8 editions published between 1989 and 2000 in 3 languages and held by 14 WorldCat member libraries worldwide
Abstract: "The 'dart' is the graph with vertices a, b, c, d, e and edges ab, ac, ad, ae, bd, cd. We present a polynomial-time algorithm to recognize dart-free perfect graphs. The algorithm is based on a decomposition theorem elucidating the structure of these graphs."
Small transversals in hypergraphs by Vašek Chvátal ( Book )
5 editions published between 1988 and 1990 in English and German and held by 9 WorldCat member libraries worldwide
Dealing with hard problems : (lecture notes on approximation algorithms and randomized algorithms) by Vašek Chvátal ( Book )
4 editions published in 1990 in German and English and held by 8 WorldCat member libraries worldwide
On cutting-plane proofs in combinatorial optimization by Vašek Chvátal ( Book )
5 editions published between 1987 and 1988 in 3 languages and held by 6 WorldCat member libraries worldwide
Hypergraphs and Ramseyian theorems by Vašek Chvátal ( )
3 editions published in 1970 in English and held by 5 WorldCat member libraries worldwide
Which line-graphs are perfectly orderable? by Vašek Chvátal ( Book )
3 editions published in 1989 in German and Undetermined and held by 5 WorldCat member libraries worldwide
Lecture notes on the new AKS sorting network by Vašek Chvátal ( Book )
1 edition published in 1992 in English and held by 4 WorldCat member libraries worldwide
The basic units in this new construction are sorting networks on M wires such that M is relatively small; these may be thought of as indivisible hardware elements (rather than networks made from comparators); following Knuth, we call them M-sorters. For every choice of positive integers M and N such that N [> or =] M, the construction yields a sorting network on N wires, made from M-sorters, whose depth is at most (48 + o(1)) log [subscript M] N + 115 as M [approaches] [infinity]. (It is worth emphasizing that the asymptotic o(1) here is relative to M rather than N.)."
Determining the Stability Number of a Graph by Vašek Chvátal ( Book )
3 editions published between 1976 and 1977 in English and held by 3 WorldCat member libraries worldwide
Certain rules for deriving upper bounds on the stability number of a graph are formalized. The resulting system is powerful enough to (1) encompass the algorithms of Tarjan's type and (2) provide very short proofs on graphs for which the stability number equals the clique-covering number. However, the main result shows that for almost all graphs with a (sufficiently large) linear number of edges, proofs within the system must have at least exponential length
Packing paths perfectly by J Akiyama ( Book )
1 edition published in 1988 in English and held by 3 WorldCat member libraries worldwide
Degrees and matchings by Vašek Chvátal ( Book )
1 edition published in 1972 in English and held by 3 WorldCat member libraries worldwide
Mick gets some (the odds are on his side) by Vašek Chvátal ( Book )
2 editions published in 1992 in German and English and held by 3 WorldCat member libraries worldwide
Edmonds polyhedra and weakly Hamiltonian graphs by Vašek Chvátal ( Book )
1 edition published in 1972 in English and held by 3 WorldCat member libraries worldwide
Solutions manual for linear programming by Vašek Chvátal ( Book )
1 edition published in 1984 in English and held by 3 WorldCat member libraries worldwide
Cutting-plane proofs and the stability number of a graph by Vašek Chvátal ( Book )
2 editions published in 1984 in German and English and held by 3 WorldCat member libraries worldwide
Distances in orientations of graphs by Vašek Chvátal ( Book )
1 edition published in 1975 in English and held by 2 WorldCat member libraries worldwide
Edmonds polyhedra and a hierarchy of combinatorial problems by Vašek Chvátal ( Book )
1 edition published in 1972 in English and held by 2 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.56 (from 0.22 for Solutions ... to 1.00 for Some resul ...)
Alternative Names
Akiyama-Chvátal, .. 1946-
Chvátal, V.
Chvátal, V. (Vaclav)
Chvátal, Vaclav 1946-
Chvátal, Vasek
フバータル, バシェク
Languages
English (59)
German (14)
Covers