17. The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in)Approximability

  1. Vangelis Th. Paschos
  1. Jérǒme Monnot

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch17

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Monnot, J. (2008) The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in)Approximability, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch17

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • approximation properties;
  • polynomial-time;
  • communication network;
  • objective labeled function;
  • timetable problem

Summary

This chapter contains sections titled:

  • Introduction

  • The 2-regular bipartite case

  • Some inapproximation results

  • The complete bipartite case

  • Bibliography