Greedoids (Algorithms and Combinatorics) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024


Greedoids (Algorithms and Combinatorics)

简体网页||繁体网页
B. H. Korte 作者
Springer
译者
1991-10 出版日期
0 页数
USD 135.00 价格
Hardcover
丛书系列
9780387181905 图书编码

Greedoids (Algorithms and Combinatorics) 在线电子书 图书标签:  


喜欢 Greedoids (Algorithms and Combinatorics) 在线电子书 的读者还喜欢




点击这里下载
    

想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

发表于2024-12-25


Greedoids (Algorithms and Combinatorics) 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

Greedoids (Algorithms and Combinatorics) 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

Greedoids (Algorithms and Combinatorics) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024



Greedoids (Algorithms and Combinatorics) 在线电子书 用户评价

评分

评分

评分

评分

评分

Greedoids (Algorithms and Combinatorics) 在线电子书 著者简介


Greedoids (Algorithms and Combinatorics) 在线电子书 图书目录


Greedoids (Algorithms and Combinatorics) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 在线电子书下载

Greedoids (Algorithms and Combinatorics) 在线电子书 图书描述

With 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 theroy and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partically 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 greedoids.

Greedoids (Algorithms and Combinatorics) 在线电子书 下载 mobi epub pdf txt 在线电子书下载

想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

Greedoids (Algorithms and Combinatorics) 在线电子书 读后感

评分

评分

评分

评分

评分

类似图书 点击查看全场最低价

Greedoids (Algorithms and Combinatorics) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024


分享链接





Greedoids (Algorithms and Combinatorics) 在线电子书 相关图书




本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

友情链接

© 2024 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有