Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tobias Harks
The K-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks
Related publications
Iterative Algorithms Based on the Viscosity Approximation Method for Equilibrium and Constrained Convex Minimization Problem
Fixed Point Theory and Applications
Geometry
Applied Mathematics
Topology
Approximation Algorithms for Computing Capacity of Wireless Networks With SINR Constraints
Algorithms for Minimum Bipartite Fill-In and the Gene-Duplication Problem
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Approximation Algorithms for Geometric Networks
Approximation Algorithms for the Shortest Superstring Problem.
Utility-Based Resource Allocation With Bipartite Matching in OFDMA-based Wireless Systems
KSII Transactions on Internet and Information Systems
Computer Networks
Information Systems
Communications
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Optimal Matching in Wireless Sensor Networks
IEEE Journal on Selected Topics in Signal Processing
Electronic Engineering
Signal Processing
Electrical
