Finding near-optimal independent sets at scale (Q2401330): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Finding Near-Optimal Independent Sets at Scale
description / endescription / en
scientific article
scientific article; zbMATH DE number 7104464
Property / title
 
Finding Near-Optimal Independent Sets at Scale (English)
Property / title: Finding Near-Optimal Independent Sets at Scale (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1430.90494 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611974317.12 / rank
 
Normal rank
Property / published in
 
Property / published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) / rank
 
Normal rank
Property / publication date
 
12 September 2019
Timestamp+2019-09-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 September 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7104464 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2719042323 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.00764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to MCS algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using critical sets to solve the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of Labeling Strategies for Rotating Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time FPT Algorithms via Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding near-optimal independent sets at scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bit parallel exact maximum clique algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Maximum Independent Set / rank
 
Normal rank

Latest revision as of 09:37, 14 July 2024

scientific article; zbMATH DE number 7104464
  • Finding Near-Optimal Independent Sets at Scale
Language Label Description Also known as
English
Finding near-optimal independent sets at scale
scientific article; zbMATH DE number 7104464
  • Finding Near-Optimal Independent Sets at Scale

Statements

Finding near-optimal independent sets at scale (English)
0 references
Finding Near-Optimal Independent Sets at Scale (English)
0 references
0 references
0 references
0 references
0 references
0 references
8 September 2017
0 references
12 September 2019
0 references
maximum independent set problem
0 references
minimum vertex cover problem
0 references
evolutionary/genetic algorithms
0 references
heuristic algorithms
0 references
local search
0 references
kernelization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references