WorldCat Identities
Fri Mar 21 17:03:16 2014 UTClccn-n780585450.37N is a number a portrait of Paul Erdős /0.710.93Matroid theory /108138878László_Lovászn 78058545194257Lovász, L.Lovász, L. 1948-Lovász, L. (László), 1948-Lovász, LászlóLovasz, Laszlo, 1948-ロバース, ラスロウlccn-n82013125Grötschel, Martinedtlccn-n2002159920Pelikán, J.(József)lccn-n86092189Katona, G.edtlccn-n2002159917Vsztergombi, K.(Katalin)lccn-n83011442Sós, Vera T.edtlccn-n00007156Győri, Ervin1954-edtlccn-n95001152Cook, William1957-edtlccn-n88624846Hajnal, A.edtlccn-n00011223Vygen, Jensedtlccn-n80033469Graham, Ronald L.1935-edtLovász, László1948-Conference proceedingsHandbooks, manuals, etcBiographyFilm adaptationsCombinatorial analysisComputer science--MathematicsMathematicsGraph theoryCombinatorial optimizationNumber theoryMatching theoryMathematical optimizationCombinatorial geometryGeometry of numbersProgramming (Mathematics)Convex domainsMathematiciansHungaryErdős, Paul,Algebra, AbstractAlgorithmsGreedoidsComputer programmingMachine translatingMatroidsHoffman, Paul,AlgebraComputational complexitySet theoryMathematics--PhilosophyOperations researchComputer scienceMathematical statisticsLogic, Symbolic and mathematicalElectronic data processingEconomics194819731975197719781979198019811982198319841985198619871988198919901991199219931994199519981999200220032004200520062007200820092010201220138519142482511.6QA164ocn869825923ocn310850113ocn025349348ocn468742037ocn025333363ocn025349246ocn025349323ocn797717490ocn864494173ocn797314637ocn846450795ocn845385663ocn185550630118717ocn056344430file20030.50Lovász, LászlóDiscrete mathematics elementary and beyond"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."--Jacket+-+522267238574834ocn004211150book19790.70Lovász, LászlóCombinatorial problems and exercises+-+K9506399956269ocn310352997file20080.70Cook, WilliamResearch trends in combinatorial optimization Bonn 2008Conference proceedingsThis book, written by leading experts in combinatorial optimization, features in-depth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization+-+404212590859429ocn017299859book19810.76Grötschel, MartinGeometric algorithms and combinatorial optimizationThis book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and - in particular - combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms: - the ellipsoid method for finding a point in a convex set and - the basis reduction method for point lattices. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra - for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson Prize, awarded by the Mathematical Programming Society and the American Mathematical Society57730ocn014575305book19860.73Lovász, LászlóMatching theoryThis study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing+-+24029367355089ocn032626230book19950.70Graham, Ronald LHandbook of combinatoricsHandbooks, manuals, etc+-+319873999548617ocn014373190book19860.76Lovász, LászlóAn algorithmic theory of numbers, graphs, and convexityA study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization+-+88576234354368ocn304563194file20080.73Győri, ErvinHorizons of combinatoricsConference proceedingsHungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference Horizons of Combinatorics held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students+-+44462259084137ocn679561166file20060.79Győri, ErvinMore sets, graphs, and numbers a salute to Vera Sós and András HajnalConference proceedingsDiscrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students+-+022878590825515ocn025251237book19910.81Korte, B. HGreedoidsWith the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the Rado-Hall theorem on transversals is generalized. The self-contained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids2249ocn812530987book20120.86Lovász, LászlóLarge networks and graph limits2188ocn013985373book19850.90Theory of algorithmsConference proceedings19813ocn007908905book19810.88Conference on Algebraic Methods in Graph TheoryAlgebraic methods in graph theoryConference proceedings1761ocn056349644visu20040.37Csicsery, George PaulN is a number a portrait of Paul ErdősBiographyFilm adaptationsA documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life+-+36330972453241758ocn013273970book19850.93Matroid theory16111ocn086110128book20070.79Lovász, LászlóCombinatorial problems and exercises+-+07179367351405ocn031900331book19950.90DIMACS Special Year on Combinatorial OptimizationCombinatorial optimization : papers from the DIMACS Special YearConference proceedings1367ocn012326810book19840.93Finite and infinite setsConference proceedings1326ocn076657505file20050.59Lovász, LászlóDiskrete Mathematik+-+38015759083241257ocn019785830book19880.90Hajnal, ACombinatoricsConference proceedings3524ocn649394908file20080.73Grötschel, MartinBuilding bridges between mathematics and computer scienceConference proceedingsDiscrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in Augus+-+7367035908+-+5222672385+-+5222672385Fri Mar 21 15:45:59 EDT 2014batch24960