◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Polishchuk

3 papers hereh-index 231.8k citations129 works total

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

author position
  • first author2
  • last author1

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

fields
  • cs.DS2
  • cs.DC1

identity via Semantic Scholar / OpenAlex

activity
20062010
most citedA simple local 3-approximation algorithm for vertex cover

43 citations · 43 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2010

Improved approximations for robust mincut and shortest path

Valentin Polishchuk, Mikko Sysikaski

In two-stage robust optimization the solution to a problem is built in two stages: In the first stage a partial, not necessarily feasible, solution is exhibited. Then the adversary…

cs.DS2006

The Snowblower Problem

Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell +1

We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in the SBP i…

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