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 |
-
Fast Approximation Algorithms for Finding Node-Independent Paths in Networks
White, Douglas R., (2011)
-
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Asahiro, Yuichi, (2011)
-
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Machuca, E., (2012)
- More ...
-
Trukhanov, Svyatoslav, (2013)
-
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Trukhanov, Svyatoslav, (2010)
-
Using critical sets to solve the maximum independent set problem
Butenko, Sergiy, (2007)
- More ...