Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Arindam Khan"'
Publikováno v:
Algorithmica.
Autor:
Arindam Khan, Eklavya Sharma
In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square bins. The pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b009dc6524b4e266f5acc1b3f55ca82
Autor:
Naveen Namani, Arindam Khan
Publikováno v:
ICCCS
Traditional signature-based Anti-virus (AV) detectors use signatures unique to known malware. But these signatures are manually extracted and cannot detect variants of the same malware or zero-day malware. For automatically detecting zero-day malware
Publikováno v:
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Algorithmica
Algorithmica
Best Fit is a well known online algorithm for the bin packing problem, where a collection of one-dimensional items has to be packed into a minimum number of unit-sized bins. In a seminal work, Kenyon [SODA 1996] introduced the (asymptotic) random ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a75489e53462fa12e1817c9062ec15c3
https://doi.org/10.4230/lipics.mfcs.2020.7
https://doi.org/10.4230/lipics.mfcs.2020.7
Publikováno v:
Computer Science Review. 24:63-79
The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in ( 0 , 1 ] and the goal is to place them in a minimum number of bins so that no bin holds num
Publikováno v:
Algorithmica
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity. In the online setting,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7f1839b029e1ab75b7362de68177aef
We present a $\frac74$ approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph (2-ECSS)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bf1230db92983751aeb4468e9b19f23
Publikováno v:
TrustCom/BigDataSE/ICESS
Secure interaction amongst system components is inherent to ensure the trustworthiness of the applications. In a distributed system, the attester should know whether the communicating client as well as the user who is using that client system is trus
Autor:
Prasad Raghavendra, Arindam Khan
Publikováno v:
Information Processing Letters. 114:365-371
Given a capacitated undirected graph G=(V,E) with a set of terminals [email protected]?V, a mimicking network is a smaller graph H=(V"H,E"H) which contains the set of terminals K and for every bipartition [U,K-U] of the terminals, the cost of the min