Online algorithms (Record no. 172560)

MARC details
000 -LEADER
fixed length control field 03507nam a22003257a 4500
001 - CONTROL NUMBER
control field 23337054
003 - CONTROL NUMBER IDENTIFIER
control field IIITD
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240510164904.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION
fixed length control field m |o d |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr_|||||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230920s2023 enk ob 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2023028777
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781009349185
040 ## - CATALOGING SOURCE
Original cataloging agency IIITD
042 ## - AUTHENTICATION CODE
Authentication code pcc
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Item number VAZ-O
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Vaze, Rahul
245 10 - TITLE STATEMENT
Title Online algorithms
Statement of responsibility, etc by Rahul Vaze.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc New York :
Name of publisher, distributor, etc Cambridge University Press,
Date of publication, distribution, etc ©2023
300 ## - PHYSICAL DESCRIPTION
Extent xxii, 465 p. :
Other physical details ill. ;
Dimensions 24 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Ski-rental -- List accessing -- Bin-packing -- Paging -- Metrical task system -- Secretary problem -- Knapsack -- Bipartite matching -- Primal-dual technique -- Facility location and k-Means clustering -- Load balancing -- Scheduling to minimize flow time (delay) -- Scheduling with speed scaling -- Scheduling to minimize energy with job deadlines -- Travelling salesman -- Convex optimization (server provisioning in cloud computing) -- Multi-commodity flow routing -- Resource constrained scheduling (energy harvesting communication) -- Submodular partitioning for welfare maximization.
520 ## - SUMMARY, ETC.
Summary, etc "Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"--
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Online algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element algorithms.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Print version:
Main entry heading Vaze, Rahul.
Title Online algorithms
Place, publisher, and date of publication Cambridge ; New York, NY : Cambridge University Press, 2023
International Standard Book Number 9781009349185
Record control number (DLC) 2023028776
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN)
a 7
b cbc
c orignew
d 1
e ecip
f 20
g y-gencatlg
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Bill No. Bill Date Cost, normal purchase price PO No. PO Date Total Checkouts Full call number Barcode Date last seen Cost, replacement price Price effective from Vendor/Supplier Koha item type
    Dewey Decimal Classification     Mathematics IIITD IIITD General Stacks 17/04/2024 TB4584 2024-03-31 595 IIITD/LIC/BS/2021/03/69 2024-03-27   518.1 VAZ-O 012916 17/04/2024 850 17/04/2024 Technical Bureau India Pvt. Ltd. Books
© 2024 IIIT-Delhi, library@iiitd.ac.in