Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
Year of publication: |
2010
|
---|---|
Authors: | Balasundaram, Balabhaskar ; Chandramouli, Shyam Sundar ; Trukhanov, Svyatoslav |
Published in: |
Optimization letters. - Berlin : Springer, ISSN 1862-4472, ZDB-ID 2274663-8. - Vol. 4.2010, 3, p. 311-320
|
Subject: | Graphentheorie | Graph theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
Efficient algorithm for finding k shortest paths based on re-optimization technique
Chen, Bi Yu, (2020)
-
Liang, Yile, (2024)
-
Editorial for the special issue: "Novel solutions and novel approaches in operational research"
Drobne, Samo, (2020)
- More ...
-
Trukhanov, Svyatoslav, (2013)
-
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Trukhanov, Svyatoslav, (2010)
-
A network-based data mining approach to portfolio selection via weighted clique relaxations
Boginski, Vladimir, (2014)
- More ...