Titlebook: Combinatorial Algorithms; 22th International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer-Verlag GmbH Berli

只看該作者 · 發(fā)表于 2025-3-25 15:13:12

The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.

只看該作者 · 發(fā)表于 2025-3-25 18:03:00

Quasi-Cyclic Codes over ,,to .?=?9. In this paper, linear codes over . are constructed for . up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.

只看該作者 · 發(fā)表于 2025-3-25 23:19:37

只看該作者 · 發(fā)表于 2025-3-26 00:09:22

978-3-642-25010-1Springer-Verlag GmbH Berlin Heidelberg 2011

只看該作者 · 發(fā)表于 2025-3-26 05:00:28

Costas S. Iliopoulos,William F. SmythUp-to-date results.Fast track conference proceedings.State-of-the-art report

只看該作者 · 發(fā)表于 2025-3-26 08:36:17

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229875.jpg

只看該作者 · 發(fā)表于 2025-3-26 14:16:19

只看該作者 · 發(fā)表于 2025-3-26 19:15:26

https://doi.org/10.1007/978-3-030-63223-6ithms and complexity. A . of a graph . is an assignment of colors to the vertices of . such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of . is called the . of . and is denoted by

		自動登錄	找回密碼
密碼			To register

關于派博傳思			派博傳思旗下網站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網	吾愛論文網	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經驗總結	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-9 03:19
Copyright © 2001-2015 派博傳思京公網安備110108008328 版權所有 All rights reserved