咨询与建议

限定检索结果

文献类型

  • 16 篇 期刊文献
  • 7 篇 会议

馆藏范围

  • 23 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 17 篇 工学
    • 17 篇 计算机科学与技术...
    • 4 篇 软件工程
    • 3 篇 控制科学与工程
  • 11 篇 理学
    • 11 篇 数学
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 2 篇 工商管理

主题

  • 23 篇 parameterized al...
  • 3 篇 dynamic programm...
  • 3 篇 np-hardness
  • 3 篇 bounded treewidt...
  • 2 篇 database systems
  • 2 篇 fair allocation
  • 2 篇 sql
  • 2 篇 counting
  • 2 篇 connected subgra...
  • 2 篇 indivisible reso...
  • 2 篇 data reduction
  • 2 篇 envy-freeness
  • 2 篇 wildlife crossin...
  • 2 篇 algorithm engine...
  • 2 篇 fixed-parameter ...
  • 2 篇 relational algeb...
  • 2 篇 donating goods
  • 2 篇 electoral distri...
  • 2 篇 preprocessing
  • 2 篇 computational su...

机构

  • 4 篇 tu berlin inst s...
  • 3 篇 tu wien austria
  • 3 篇 tech univ berlin...
  • 2 篇 univ potsdam pot...
  • 2 篇 tech univ dresde...
  • 2 篇 tu berlin
  • 1 篇 humboldt univ al...
  • 1 篇 czech technical ...
  • 1 篇 czech tech univ ...
  • 1 篇 max planck inst ...
  • 1 篇 nanyang technolo...
  • 1 篇 inst softwaretec...
  • 1 篇 univ jena inst i...
  • 1 篇 beijing jiaotong...
  • 1 篇 tu berlin inst s...
  • 1 篇 tech univ claust...
  • 1 篇 tech univ berlin...
  • 1 篇 tech univ berlin...
  • 1 篇 tech univ berlin...
  • 1 篇 royal holloway u...

作者

  • 9 篇 niedermeier rolf
  • 3 篇 hecher markus
  • 3 篇 kellerhals leon
  • 3 篇 fluschnik till
  • 3 篇 bredereck robert
  • 2 篇 hueffner falk
  • 2 篇 thier patrick
  • 2 篇 betzler nadja
  • 2 篇 niclas boehmer
  • 2 篇 woltran stefan
  • 2 篇 nichterlein andr...
  • 2 篇 zschoche philipp
  • 2 篇 koana tomohiro
  • 2 篇 moser hannes
  • 2 篇 boehmer niclas
  • 2 篇 fichte johannes ...
  • 2 篇 komusiewicz chri...
  • 2 篇 froese vincent
  • 1 篇 rolf niedermeier
  • 1 篇 sorge manuel

语言

  • 22 篇 英文
  • 1 篇 其他
检索条件"主题词=parameterized algorithmics"
23 条 记 录,以下是11-20 订阅
排序:
Multivariate algorithmics for Eliminating Envy by Donating Goods  22
Multivariate Algorithmics for Eliminating Envy by Donating G...
收藏 引用
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems
作者: Niclas Boehmer Robert Bredereck Klaus Heeger Dušan Knop Junjie Luo TU Berlin Berlin Germany Humboldt-Universität zu Berlin Berlin Germany Czech Technical University in Prague Prague Czech Rep Nanyang Technological University Singapore Singapore
Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might a... 详细信息
来源: 评论
A Refined Complexity Analysis of Fair Districting over Graphs  22
A Refined Complexity Analysis of Fair Districting over Graph...
收藏 引用
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems
作者: Niclas Boehmer Tomohiro Koana Rolf Niedermeier TU Berlin Berlin Germany
We study the NP-hard Fair Connected Districting problem: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at... 详细信息
来源: 评论
Exploiting Database Management Systems and Treewidth for Counting  22nd
Exploiting Database Management Systems and Treewidth for Cou...
收藏 引用
22nd International Symposium on Practical Aspects of Declarative Languages (PADL)
作者: Fichte, Johannes K. Hecher, Markus Thier, Patrick Woltran, Stefan Tech Univ Dresden Dresden Germany TU Wien Vienna Austria Univ Potsdam Potsdam Germany
Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting problem is #Sat, which asks to count the... 详细信息
来源: 评论
An Improved GPU-Based SAT Model Counter  25th
An Improved GPU-Based SAT Model Counter
收藏 引用
25th International Conference on the Principles and Practice of Constraint Programming (CP)
作者: Fichte, Johannes K. Hecher, Markus Zisser, Markus Tech Univ Dresden Dresden Germany TU Wien Vienna Austria Univ Potsdam Potsdam Germany
In this paper, we present and evaluate a new parallel propositional model counter, called gpusat2, which is based on dynamic programming (DP) on tree decompositions using log-counters. gpusat2 extends its predecessor ... 详细信息
来源: 评论
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation
收藏 引用
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2014年 第5期28卷 721-748页
作者: Betzler, Nadja Bredereck, Robert Niedermeier, Rolf TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany
Kemeny Rank Aggregation is a consensus finding problem important in many areas ranging from classical voting over web search and databases to bioinformatics. The underlying decision problem Kemeny Score is NP-complete... 详细信息
来源: 评论
The effect of homogeneity on the computational complexity of combinatorial data anonymization
收藏 引用
DATA MINING AND KNOWLEDGE DISCOVERY 2014年 第1期28卷 65-91页
作者: Bredereck, Robert Nichterlein, Andre Niedermeier, Rolf Philip, Geevarghese TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany Max Planck Inst Informat D-66123 Saarbrucken Germany
A matrix M is said to be k-anonymous if for each row r in M there are at least k - 1 other rows in M which are identical to r. The NP-hard k-Anonymity problem asks, given an n x m-matrix M over a fixed alphabet and an... 详细信息
来源: 评论
Towards Optimal and Expressive Kernelization for d-Hitting Set
收藏 引用
ALGORITHMICA 2014年 第1期70卷 129-147页
作者: van Bevern, Rene TU Berlin Inst Softwaretech & Theoret Informat D-10587 Berlin Germany
A sunflower in a hypergraph is a set of hyperedges pairwise intersecting in exactly the same vertex set. Sunflowers are a useful tool in polynomial-time data reduction for problems formalizable as d-Hitting Set, the p... 详细信息
来源: 评论
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
收藏 引用
COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE 2013年 第1期2卷 31-49页
作者: Ehrig, Hartmut Ermel, Claudia Hueffner, Falk Niedermeier, Rolf Runge, Olga Inst Softwaretechnik & Theoret Informat TU Berlin Sekr MAR 5-5Marchstr 23 D-10587 Berlin Germany
Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization reduces in polynomial time an input instance to an equivalent instance whose size is bou... 详细信息
来源: 评论
Exact combinatorial algorithms and experiments for finding maximum k-plexes
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2012年 第3期24卷 347-373页
作者: Moser, Hannes Niedermeier, Rolf Sorge, Manuel TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany
We propose new practical algorithms to find maximum-cardinality k-plexes in graphs. A k-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most k vertices in the k-p... 详细信息
来源: 评论
Cluster editing with locally bounded modifications
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第15期160卷 2259-2270页
作者: Komusiewicz, Christian Uhlmann, Johannes TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany
Given an undirected graph G = (V, E) and a nonnegative integer k, the NP-hard CLUSTER EDITING problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. In this work, we s... 详细信息
来源: 评论