◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Adam N. Letchford

9 papers hereh-index 334.4k citations234 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author3
  • last author3

Across the 8 of 9 papers where every author was matched, so the position is known.

fields
  • math.OC6
  • cs.LG1
  • math.CO1
  • stat.CO1

identity via Semantic Scholar / OpenAlex

activity
20062023
most citedOperational Research: Methods and Applications

120 citations · 127 across the 8 of their papers we have counts for

collaborators
Showing 2006Show all

1 paper · 1 filter

math.OC2006★ 2 cited

Odd minimum cut sets and b-matchings revisited

Adam N. Letchford, Dirk Oliver Theis

The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.