Approximation of knapsack problems with conflict and forcing graphs (Englisch)
- Neue Suche nach: Pferschy, U.
- Neue Suche nach: Schauer, J.
- Neue Suche nach: Pferschy, U.
- Neue Suche nach: Schauer, J.
In:
JOURNAL OF COMBINATORIAL OPTIMIZATION
;
33
, 4
;
1300-1323
;
2017
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:Approximation of knapsack problems with conflict and forcing graphs
-
Beteiligte:Pferschy, U. ( Autor:in ) / Schauer, J. ( Autor:in )
-
Erschienen in:JOURNAL OF COMBINATORIAL OPTIMIZATION ; 33, 4 ; 1300-1323
-
Verlag:
- Neue Suche nach: Springer Science + Business Media
-
Erscheinungsdatum:01.01.2017
-
Format / Umfang:24 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 511.6
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 511.6 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 33, Ausgabe 4
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1145
-
A lower bound for the adaptive two-echelon capacitated vehicle routing problemSong, Liang / Gu, Hao / Huang, Hejiao et al. | 2016
- 1168
-
Optimal RSUs deployment with delay bound along highways in VANETLiu, Chunyan / Huang, Hejiao / Du, Hongwei et al. | 2016
- 1183
-
A tighter insertion-based approximation of the crossing numberChimani, Markus / Hliněný, Petr et al. | 2016
- 1226
-
Maximum flows in generalized processing networksHolzhauser, Michael / Krumke, Sven O. / Thielen, Clemens et al. | 2016
- 1257
-
Lambda number for the direct product of some family of graphsKim, Byeong Moon / Rho, Yoomi / Song, Byung Chul et al. | 2016
- 1266
-
Paired-domination number of claw-free odd-regular graphsYang, Wei / An, Xinhui / Wu, Baoyindureng et al. | 2016
- 1276
-
Optimal RSUs placement with delay bounded message dissemination in vehicular networksLiu, Chunyan / Huang, Hejiao / Du, Hongwei / Jia, Xiaohua et al. | 2016
- 1300
-
Approximation of knapsack problems with conflict and forcing graphsPferschy, Ulrich / Schauer, Joachim et al. | 2016
- 1324
-
On the coefficients of the independence polynomial of graphsLi, Shuchao / Liu, Lin / Wu, Yueyu et al. | 2016
- 1343
-
Even factors of graphsCheng, Jian / Zhang, Cun-Quan / Zhu, Bao-Xuan et al. | 2016
- 1354
-
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorableBai, Ying / Li, Xiangwen / Yu, Gexin et al. | 2016
- 1365
-
A new graph parameter and a construction of larger graph without increasing radio k-chromatic numberSarkar, Ushnish / Adhikari, Avishek et al. | 2016
- 1378
-
Bounds for the traveling salesman paths of two-dimensional modular latticesPausinger, Florian et al. | 2016
- 1395
-
A new effective branch-and-bound algorithm to the high order MIMO detection problemTian, Ye / Li, Ke / Yang, Wei / Li, Zhiyong et al. | 2016
- 1411
-
A new upper bound for the online square packing problem in a stripYu, Guosong / Mao, Yanling / Xiao, Jiaoliao et al. | 2016
- 1421
-
On irreducible no-hole L(2, 1)-coloring of subdivision of graphsMandal, Nibedita / Panigrahi, Pratima et al. | 2016
- 1443
-
The (vertex-)monochromatic index of a graphLi, Xueliang / Wu, Di et al. | 2016
- 1454
-
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowanceMor, Baruch / Mosheiov, Gur et al. | 2016
- 1469
-
The solution of a generalized secretary problem via analytic expressionsWoryna, Adam et al. | 2016