The K-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks

doi 10.1109/infcom.2010.5462027
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Iterative Algorithms Based on the Viscosity Approximation Method for Equilibrium and Constrained Convex Minimization Problem

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2012English

Approximation Algorithms for Computing Capacity of Wireless Networks With SINR Constraints

2008English

Algorithms for Minimum Bipartite Fill-In and the Gene-Duplication Problem

English

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2018English

Approximation Algorithms for Geometric Networks

English

Approximation Algorithms for the Shortest Superstring Problem.

English

Utility-Based Resource Allocation With Bipartite Matching in OFDMA-based Wireless Systems

KSII Transactions on Internet and Information Systems
Computer NetworksInformation SystemsCommunications
2012English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Optimal Matching in Wireless Sensor Networks

IEEE Journal on Selected Topics in Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy