Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg | yi}@it.uu.se

Source URL: user.it.uu.se

New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc

Source URL: barbierm01.users.greyc.fr

Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample

Source URL: arvanzuijlen.people.wm.edu

Polynomial-time special cases of NP-hard problems

Source URL: zoo.cs.yale.edu

Minimum Bisection is NP-hard on Unit Disk Graphs Josep D´ıaz1 and George B. Mertzios2∗ 1 2

Source URL: community.dur.ac.uk

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann∗ Tobias Friedrich†

Source URL: people.mpi-inf.mpg.de

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Source URL: www.daviddelaat.nl

• Graph theory
• Mathematics
• NP-complete problems
• Information theory
• Combinatorial optimization
• NP-hard problems
• Lovsz number
• Independent set

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-hard problems
• NP-complete problems
• Edsger W. Dijkstra
• Combinatorial optimization
• Approximation algorithms
• Travelling salesman problem
• Shortest path problem
• Matching
• Randomized algorithm

LNCSA Standard Framework for Timetabling Problems

Source URL: stefan.buettcher.org

• Constraint programming
• Mathematical optimization
• Artificial intelligence
• Theoretical computer science
• Applied mathematics
• Constraint logic programming
• NP-hard problems
• Operations research
• Genetic algorithm
• Nurse scheduling problem
• Constrained optimization