Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Daniel Rehfeldt
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
SIAM Journal on Optimization
Theoretical Computer Science
Software
Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Related publications
New Heuristics for the Maximum Diversity Problem
Journal of Heuristics
Control
Information Systems
Management Science
Computer Networks
Communications
Optimization
Operations Research
Artificial Intelligence
Software
Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
Exact Algorithms for NP-Hard Problems: A Survey
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A New Bound for the 2-Edge Connected Subgraph Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
Maximum Algebraic Connectivity Augmentation Is NP-hard
Operations Research Letters
Industrial
Applied Mathematics
Manufacturing Engineering
Management Science
Operations Research
Software
An Exact Algorithm for the Capacitated Vertex -Center Problem
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
An Improved Bit Parallel Exact Maximum Clique Algorithm
Optimization Letters
Control
Optimization
