Connections in combinatorial optimization / András Frank.

Saved in:
Bibliographic Details
Main Author: Frank, András, 1949-
Language:English
Published: Oxford : Oxford University Press, 2011.
Series:Oxford lecture series in mathematics and its applications ; 38.
Subjects:
Combinatorial optimization.
Connections (Mathematics)
Physical Description:xxiii, 639 pages : illustrations ; 24 cm.
Format: Book

MARC

LEADER 00000cam a2200000Ia 4500
001 in00004979900
003 OCoLC
005 20220616032634.0
008 080902s2011 enka b 001 0 eng d
010 |a  2010942420 
015 |a GBA8A7098  |2 bnb 
020 |a 9780199205271 (hbk.) 
020 |a 0199205272 (hbk.) 
035 |a (CaEvSKY)sky238349549 
035 |a (OCoLC)708054212 
040 |a NLE  |c NLE  |d YDXCP  |d CUD  |d UAB  |d IXA  |d CDX  |d CUY  |d UtOrBLW 
049 |a EEMR 
050 4 |a QA402.5  |b .F69735 2011 
082 0 4 |a 519.64  |2 22 
100 1 |a Frank, András,  |d 1949-  |0 http://id.loc.gov/authorities/names/nb2011008532 
245 1 0 |a Connections in combinatorial optimization /  |c András Frank. 
260 |a Oxford :  |b Oxford University Press,  |c 2011. 
300 |a xxiii, 639 pages :  |b illustrations ;  |c 24 cm. 
336 |a text  |b txt  |2 rdacontent 
337 |a unmediated  |b n  |2 rdamedia 
338 |a volume  |b nc  |2 rdacarrier 
490 1 |a Oxford lecture series in mathematics and its applications ;  |v 38 
504 |a Includes bibliographical references (pages [605]-621) and indexes. 
505 0 0 |g Machine generated contents note:  |g pt. I  |t BASIC COMBINATORIAL OPTIMIZATION --  |g 1.  |t Elements of graphs and hypergraphs --  |g 1.1.  |t Fundamentals --  |g 1.2.  |t Cut functions and connectivity concepts --  |g 1.3.  |t Special graphs and digraphs --  |g 1.4.  |t Special hypergraphs and bi-set systems --  |g 1.5.  |t Complexity of problems and algorithms --  |g 2.  |t Connectivity, paths, and matchings --  |g 2.1.  |t 2-connection of graphs --  |g 2.2.  |t Strong connectivity --  |g 2.3.  |t Degree-constrained orientations --  |g 2.4.  |t Bipartite matchings --  |g 2.5.  |t Disjoint paths --  |g 3.  |t Elements of network optimization --  |g 3.1.  |t Cheapest paths and feasible potentials --  |g 3.2.  |t Cheapest trees and arborescences --  |g 3.3.  |t Weighted matchings of bipartite graphs --  |g 3.4.  |t Flows and circulations --  |g 3.5.  |t Computing maximum flows --  |g 3.6.  |t Cheapest flows --  |g 4.  |t Elements of polyhedral combinatorics --  |g 4.1.  |t Linear inequality systems and polyhedra --  |g 4.2.  |t Total unimodularity --  |g 4.3.  |t Applications of totally unimodular matrices --  |g 5.  |t Elements of matroid theory. 
505 0 0 |g 5.1.  |t Independence and rank --  |g 5.2.  |t Circuits and connectivity --  |g 5.3.  |t Bases, rank, and co-rank --  |g 5.4.  |t Constructing matroids --  |g 5.5.  |t Matroid algorithms and polyhedra --  |g pt. II  |t HIGHER-ORDER CONNECTIONS --  |g 6.  |t Efficient algorithms for flows and cuts --  |g 6.1.  |t Push-relabel algorithms --  |g 6.2.  |t Computing a minimum cut of a digraph --  |g 6.3.  |t Computing a minimum cut of an undirected graph --  |g 6.4.  |t Strongly polynomial algorithm for cheapest m-flows --  |g 7.  |t Structure and representations of cuts --  |g 7.1.  |t Cactus representation of minimum cuts --  |g 7.2.  |t Local edge-connectivities --  |g 7.3.  |t Solid sets --  |g 7.4.  |t Sparse certificates for directed graphs and hypergraphs --  |g 7.5.  |t Sparse certificates for undirected graphs --  |g 8.  |t The splitting-off operation and constructive characterizations --  |g 8.1.  |t Undirected splitting --  |g 8.2.  |t Directed splitting --  |g 8.3.  |t Further constructive characterizations --  |g 8.4.  |t Packing paths --  |g 9.  |t Orientations of graphs and hypergraphs --  |g 9.1.  |t Rooted k-edge-connected orientations and reorientations --  |g 9.2.  |t Global k-edge-connection. 
505 0 0 |g 9.3.  |t Common generalization: (k, l)-edge-connected orientations --  |g 9.4.  |t Orientation of hypergraphs --  |g 9.5.  |t Mixed graphs and orientations --  |g 9.6.  |t Optimal orientations and reorientations --  |g 9.7.  |t Optimal strongly connected reorientation --  |g 9.8.  |t Well-balanced orientations --  |g 10.  |t Trees and arborescences: packing and covering --  |g 10.1.  |t Packing arborescences --  |g 10.2.  |t Packing branchings --  |g 10.3.  |t Further generalizations --  |g 10.4.  |t Covering by branchings, trees, and forests --  |g 10.5.  |t Packing trees and forests --  |g 11.  |t Preserving and improving connections --  |g 11.1.  |t Augmenting edge-connectivity of undirected graphs --  |g 11.2.  |t Augmenting edge-connectivity of directed graphs --  |g 11.3.  |t Augmenting ST-edge- and node-connectivity of digraphs --  |g 11.4.  |t Rooted k-connections --  |g pt. III  |t SEMIMODULAR OPTIMIZATION --  |g 12.  |t Setting the stage -- aspects and approaches --  |g 12.1.  |t Two aspects of investigation --  |g 12.2.  |t Convexity and submodularity --  |g 12.3.  |t Abstract extensions of the Konig-Hall theorem --  |g 13.  |t Matroid optimization --  |g 13.1.  |t Unweighted matroid intersection. 
505 0 0 |g 13.2.  |t Weighted matroid intersection --  |g 13.3.  |t Sum of matroids --  |g 13.4.  |t Matroids from intersecting sub- and supermodular functions --  |g 13.5.  |t Count matroids --  |g 14.  |t Generalized polymatroids --  |g 14.1.  |t Semimodular functions and their polyhedra --  |g 14.2.  |t Constructions and operations --  |g 14.3.  |t Intersection with a box and with a plank --  |g 14.4.  |t Intersection of two g-polymatroids --  |g 14.5.  |t The greedy algorithm --  |g 15.  |t Relaxing semimodularity --  |g 15.1.  |t Truncation --  |g 15.2.  |t Applications to branchings and augmentations --  |g 15.3.  |t Full truncation --  |g 15.4.  |t Graph orientations via base-polyhedra --  |g 16.  |t Submodular flows --  |g 16.1.  |t Submodular and supermodular flows --  |g 16.2.  |t A push-relabel algorithm for submodular flows --  |g 16.3.  |t Optimization over submodular flows --  |g 17.  |t Covering supermodular functions by digraphs --  |g 17.1.  |t Supermodular frameworks with TDI systems --  |g 17.2.  |t Non-TDI frameworks for covering set-functions --  |g 17.3.  |t Non-TDI frameworks for covering bi-set functions --  |g 18.  |t Solutions to selected problems. 
650 0 |a Combinatorial optimization.  |0 http://id.loc.gov/authorities/subjects/sh85028809 
650 0 |a Connections (Mathematics)  |0 http://id.loc.gov/authorities/subjects/sh85031181 
830 0 |a Oxford lecture series in mathematics and its applications ;  |v 38.  |0 http://id.loc.gov/authorities/names/n94044383 
907 |y .b90480338  |b 210805  |c 111018 
998 |a rs  |b 120131  |c m  |d a   |e -  |f eng  |g enk  |h 0  |i 1 
999 f f |i 0a686c56-eea5-5508-9ae7-bba095cb6873  |s e3fa07f9-ebcc-57ac-b385-c88bee439f5f  |t 0 
952 f f |p Can Circulate  |a Michigan State University-Library of Michigan  |b Michigan State University  |c MSU Remote Storage  |d MSU Remote Storage  |t 0  |e QA402.5 .F69735 2011  |h Library of Congress classification  |i Printed Material  |m 31293007216330  |n 1