Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3134639002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining Coal or Finding Terrorists: The Expanding Search Paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for expanding search games on general networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expanding search ratio of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster, Better Approximation Algorithm for the Minimum Latency Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency path restoration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lateness Minimization in Pairwise Connectivity Restoration Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating a class of combinatorial problems with rational objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min sum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Submodular Search and Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Tasks with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density maximization problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Search. I. Kinematic Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Search. II. Target Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple searchers searching for a randomly distributed immobile target on a unit network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Local Search in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the single machine sequencing problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling Polyhedra with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search for moving targets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Complexity of the Optimal Searcher Path Problem / rank
 
Normal rank

Latest revision as of 11:13, 29 July 2024

scientific article; zbMATH DE number 7549378
Language Label Description Also known as
English
Exact and Approximation Algorithms for the Expanding Search Problem
scientific article; zbMATH DE number 7549378

    Statements

    Exact and Approximation Algorithms for the Expanding Search Problem (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    search problems
    0 references
    network optimization
    0 references
    branch-and-cut
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers