Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Scheduling and Flow-Related Problems in Networks

by Alexander Hall
Save 12% Save 12%
Current price ₹4,533.00
Original price ₹5,145.00
Original price ₹5,145.00
Original price ₹5,145.00
(-12%)
₹4,533.00
Current price ₹4,533.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783836417013
  • Binding: Paperback
  • Subject: N/A
  • Publisher: VDM Verlag Dr. Mueller E.K.
  • Publisher Imprint: VDM Verlag Dr. Mueller E.K.
  • Publication Date:
  • Pages: 160
  • Original Price: GBP 40.67
  • Language: English
  • Edition: N/A
  • Item Weight: 264 grams
  • BISAC Subject(s): Networking / General

Recently the number of applications in the Internet which use data broad-casts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various appli-cations in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible? Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives intro-ductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation net-works.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us