Greedoids

Bernhard Korte · Laszlo Lovasz · Rainer Schrader

ଡିସେମ୍ବର 2012 · Algorithms and Combinatorics 4 ବହି · Springer Science & Business Media

ଇବୁକ୍

214

ପୃଷ୍ଠାଗୁଡ଼ିକ

ରେଟିଂ ଓ ସମୀକ୍ଷାଗୁଡ଼ିକୁ ଯାଞ୍ଚ କରାଯାଇନାହିଁ ଅଧିକ ଜାଣନ୍ତୁ

ଏହି ଇବୁକ୍ ବିଷୟରେ

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 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 greedoids.

ଏହି ଇବୁକ୍‍କୁ ମୂଲ୍ୟାଙ୍କନ କରନ୍ତୁ

ଆପଣ କଣ ଭାବୁଛନ୍ତି ତାହା ଆମକୁ ଜଣାନ୍ତୁ।

ପଢ଼ିବା ପାଇଁ ତଥ୍ୟ

ସ୍ମାର୍ଟଫୋନ ଓ ଟାବଲେଟ

Google Play Books ଆପ୍କୁ, Android ଓ iPad/iPhone ପାଇଁ ଇନଷ୍ଟଲ୍ କରନ୍ତୁ। ଏହା ସ୍ଵଚାଳିତ ଭାବେ ଆପଣଙ୍କ ଆକାଉଣ୍ଟରେ ସିଙ୍କ ହୋ‍ଇଯିବ ଏବଂ ଆପଣ ଯେଉଁଠି ଥାଆନ୍ତୁ ନା କାହିଁକି ଆନଲାଇନ୍ କିମ୍ବା ଅଫଲାଇନ୍‍ରେ ପଢ଼ିବା ପାଇଁ ଅନୁମତି ଦେବ।

ଲାପଟପ ଓ କମ୍ପ୍ୟୁଟର

ନିଜର କମ୍ପ୍ୟୁଟର୍‍ରେ ଥିବା ୱେବ୍ ବ୍ରାଉଜର୍‍କୁ ବ୍ୟବହାର କରି Google Playରୁ କିଣିଥିବା ଅଡିଓବୁକ୍‍କୁ ଆପଣ ଶୁଣିପାରିବେ।

ଇ-ରିଡର୍ ଓ ଅନ୍ୟ ଡିଭାଇସ୍‍ଗୁଡ଼ିକ

Kobo eReaders ପରି e-ink ଡିଭାଇସଗୁଡ଼ିକରେ ପଢ଼ିବା ପାଇଁ, ଆପଣଙ୍କୁ ଏକ ଫାଇଲ ଡାଉନଲୋଡ କରି ଏହାକୁ ଆପଣଙ୍କ ଡିଭାଇସକୁ ଟ୍ରାନ୍ସଫର କରିବାକୁ ହେବ। ସମର୍ଥିତ eReadersକୁ ଫାଇଲଗୁଡ଼ିକ ଟ୍ରାନ୍ସଫର କରିବା ପାଇଁ ସହାୟତା କେନ୍ଦ୍ରରେ ଥିବା ସବିଶେଷ ନିର୍ଦ୍ଦେଶାବଳୀକୁ ଅନୁସରଣ କରନ୍ତୁ।

ବେଆଇନ ବିଷୟବସ୍ତୁର ରିପୋର୍ଟ କର