記事
デジタルデータあり(Crossref)
すぐに読む
CiNii Research
(In)approximability of maximum minimal FVS
- 資料種別
- 記事
- 著者
- Louis Dubloisほか
- 出版者
- Elsevier BV
- 出版年
- 2022-03
- 資料形態
- デジタル
- 掲載誌名
- Journal of Computer and System Sciences 124
- 掲載ページ
- p.26-40
全国の図書館の所蔵
国立国会図書館以外の全国の図書館の所蔵状況を表示します。
所蔵のある図書館から取寄せることが可能かなど、資料の利用方法は、ご自身が利用されるお近くの図書館へご相談ください
書誌情報
この資料の詳細や典拠(同じ主題の資料を指すキーワード、著者名)等を確認できます。
デジタル
- 資料種別
- 記事
- 著者標目
- 出版年月日等
- 2022-03
- 出版年(W3CDTF)
- 2022-03
- タイトル(掲載誌)
- Journal of Computer and System Sciences
- 巻号年月日等(掲載誌)
- 124
- 掲載巻
- 124
- 掲載ページ
- 26-40
- 掲載年月日(W3CDTF)
- 2022-03
- ISSN(掲載誌)
- 00220000
- 出版事項(掲載誌)
- Elsevier BV
- 件名標目
- 対象利用者
- 一般
- DOI
- 10.1016/j.jcss.2021.09.001
- 作成日(W3CDTF)
- 2021-09-21
- 著作権情報
- https://www.elsevier.com/tdm/userlicense/1.0/https://doi.org/10.15223/policy-017https://doi.org/10.15223/policy-037https://doi.org/10.15223/policy-012https://doi.org/10.15223/policy-029https://doi.org/10.15223/policy-004
- 関連情報(URI)
- 参照
- Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-WidthBounds on upper transversals in hypergraphsWeighted upper domination numberApproximation of min coloring by moderately exponential algorithmsAn induced subgraph characterization of domination perfect graphsOn the computational complexity of upper fractional dominationWeighted Upper Edge Cover: Complexity and ApproximabilityUpper Domination: Towards a Dichotomy Through Boundary PropertiesOn the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering ProblemExponential-time approximation of weighted set coverAn Improved Algorithm for Parameterized Edge Dominating Set ProblemOn the maximum weight minimal separatorApproximating MAX SAT by moderately exponential and parameterized algorithmsUpper transversals in hypergraphsChordal graphs and upper irredundance, upper domination and independenceNew Tools and Connections for Exponential-Time ApproximationThe Lazy Bureaucrat scheduling problemAlgorithmic aspects of upper paired-domination in graphsAn effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problemTime-approximation trade-offs for inapproximable problemsOn the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding threeDeterministic single exponential time algorithms for connectivity problems parameterized by treewidthThe many facets of upper dominationMaximum Minimal Vertex Cover Parameterized by Vertex CoverA note on the approximation of a minimum-weight maximal independent setLinear degree extractors and the inapproximability of Max Clique and Chromatic NumberClique is hard to approximate within n1−εOn the max min vertex cover problemExact and approximate bandwidthGrundy coloring & friends, half-graphs, bicliquesSolving connectivity problems parameterized by treewidth in single exponential timeGrundy distinguishes treewidth from pathwidthOn the complexity of the upper r-tolerant edge cover problemIndependent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnessesParameterized algorithms for maximum cut with connectivity constraintsThe lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design(In)approximability of Maximum Minimal FVSOn upper transversals in 3-uniform hypergraphsSub-exponential approximation schemes for csps: from dense to almost sparseImproved (in-)approximability bounds for d-scattered setParameterized algorithms for even cycle transversal
- 連携機関・データベース
- 国立情報学研究所 : CiNii Research
- 提供元機関・データベース
- Crossref科学研究費助成事業データベース科学研究費助成事業データベース