STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Certified computation of the sign of a matrix determinant
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Tree packing and approximating k-cuts
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem
Computational Optimization and Applications
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A finite basis characterization of α-split colorings
Discrete Mathematics - Kleitman and combinatorics: a celebration
Equilateral Dimension of the Rectilinear Space
Designs, Codes and Cryptography
Methods for binary multidimensional scaling
Neural Computation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Skeleton of the Metric Polytope
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Interval routing in some planar networks
Theoretical Computer Science
Note: isometric embeddings of subdivided wheels in hypercubes
Discrete Mathematics
Cubic inflation, mirror graphs, regular maps, and partial cubes
European Journal of Combinatorics
The six-dimensional Delaunay polytopes
European Journal of Combinatorics - Special issue on arithmétique et combinatoire
Theoretical Computer Science - Latin American theorotical informatics
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The isometries of the cut, metric and hypermetric cones
Journal of Algebraic Combinatorics: An International Journal
On the canonical metric representation, average distance, and partial Hamming graphs
European Journal of Combinatorics
Infinite series of extreme Delaunay polytopes
European Journal of Combinatorics
On the structure of the tight-span of a totally split-decomposable metric
European Journal of Combinatorics
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
How to compute the rank of a Delaunay polytope
European Journal of Combinatorics
Lattice Delone simplices with super-exponential volume
European Journal of Combinatorics
Partial cubes and their τ-graphs
European Journal of Combinatorics
Transitive actions of finite abelian groups of sup-norm isometries
European Journal of Combinatorics
Finite metrics in switching classes
Discrete Applied Mathematics
Linearly independent split systems
European Journal of Combinatorics
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities
Discrete Applied Mathematics
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
Testing embeddability between metric spaces
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
A basic toolbox for constrained quadratic 0/1 optimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Inapproximability for planar embedding problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
Discrete Applied Mathematics
Methods for the group classification of multi-attribute objects (part 2)
Scientific and Technical Information Processing
Methods for the group classification of multi-attribute objects (part 1)
Scientific and Technical Information Processing
Embedding into the rectilinear plane in optimal O(n2) time
Theoretical Computer Science
Support sets in exponential families and oriented matroid theory
International Journal of Approximate Reasoning
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Geometric crossover for sets, multisets and partitions
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
LSH-preserving functions and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Geometric crossover for biological sequences
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
On the hardness of embeddings between two finite metrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A nonlinear approach to dimension reduction
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Weakly convex coupling continuous cuts and shape priors
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Integer quadratic quasi-polyhedra
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Solving survivable two-layer network design problems by metric inequalities
Computational Optimization and Applications
Discrete Applied Mathematics
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Convex Excess in Partial Cubes
Journal of Graph Theory
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
Metric inequalities and the Network Loading Problem
Discrete Optimization
Local Versus Global Properties of Metric Spaces
SIAM Journal on Computing
Restricted strong convexity and weighted matrix completion: optimal bounds with noise
The Journal of Machine Learning Research
Gap inequalities for the max-cut problem: a cutting-plane algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Fast planar correlation clustering for image segmentation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
The robust network loading problem with dynamic routing
Computational Optimization and Applications
Semi-supervised learning using greedy max-cut
The Journal of Machine Learning Research
On the extension complexity of combinatorial polytopes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, distance geometry, combinatorial matrix theory, statistical physics, VLSI design etc. A main feature of this book is its interdisciplinarity. The book contains a wealth of results, from different mathematical disciplines, which are presented here in a unified and comprehensive manner. Geometric representations and methods turn out to be the linking theme. This book will provide a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics. [ ] The book is very nicely written [ ] The book is also very well structured. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [ ] In my opinion, the book is a beautiful piece of work. The longer one works with it, the more beautiful it becomes." Robert Weismantel, Optima 56 (1997) " In short, this is a very interesting book which is nice to have." Alexander I. Barvinok, MR 1460488 (98g:52001) " This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." R.Dawson, Zentralblatt MATH Database 0885.52001