◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

L. Fleischer

8 papers hereh-index 365.4k citations76 works total

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

author position
  • first author2
  • middle author4
  • last author1

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

fields
  • cs.GT4
  • cs.DS2
  • cs.DM1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20002012
most citedSubmodular approximation: sampling-based algorithms and lower bounds

69 citations · 80 across the 8 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2000★ 3 cited

A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions

Satoru Iwata, Lisa Fleischer, Satoru Fujishige

This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Sc…

◍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.