Algorithmic aspects in information and management

Viac o knihe

This book explores various advanced topics in algorithms and optimization, particularly in the context of online advertising and collaborative filtering. It delves into the approximability of haplotyping problems and examines acyclicity in games with cycles. The discussion includes discrete online TSP and methods for approximating implicit cover problems in biology. Additionally, it covers power indices in spanning connectivity games and efficient generation of k-best solutions for procurement auctions. The text addresses integer polyhedra for program analysis, strategies for placing monitors in flow networks, and frequency assignment in linear cellular networks. It also presents insights into link distance and shortest path problems in geometric contexts, along with Orca reduction and contraction graph clustering techniques. The book discusses equiseparability on the terminal Wiener index and effective tour searching for TSP through pseudo backbone edge contraction. It highlights optimal auctions that consider constraints in sponsored search and offers a note on estimating hybrid frequency moments in data streams. Further topics include a two-level push-relabel algorithm for the maximum flow problem, a relaxed model for graph-based data clustering, and dynamic position auctions with consumer search. It also presents nonlinear optimization over weighted independence systems, improved online algorithms for multiplexing we