Search results for: binary search - Bridge of Knowledge

Search

Search results for: binary search

Search results for: binary search

  • Approximation Strategies for Generalized Binary Search in Weighted Trees

    Publication

    - Year 2017

    We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...

    Full text to download in external service

  • An Efficient Noisy Binary Search in Graphs via Median Approximation

    Publication

    - LECTURE NOTES IN COMPUTER SCIENCE - Year 2021

    Consider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...

    Full text to download in external service

  • Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times

    Publication

    - Year 2022

    We consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...

    Full text to download in external service

  • The complexity of bicriteria tree-depth

    Publication

    The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...

    Full text to download in external service

  • A Population-Based Method with Selection of a Search Operator

    Publication

    - Year 2020

    This paper presents a method based on a population in which the parameters of individuals can be processed by operators from various population-based algorithms. The mechanism of selecting operators is based on the introduction of an additional binary parameters vector located in each individual, on the basis of which it is decided which operators are to be used to modify individuals’ parameters. Thus, in the proposed approach,...

  • A Framework for Searching in Graphs in the Presence of Errors

    Publication

    - Year 2019

    We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

    Full text to download in external service

  • Scheduling of compatible jobs on parallel machines

    Publication

    - Year 2021

    The dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...

  • Marek Czachor prof. dr hab.