Stack Exchange Network

Stack Exchange network consists of 181 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company, and our products.
  1. current community

    • Theoretical Computer Science
      help chat
    • Theoretical Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Theoretical Computer Science
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
  2. Teams
    Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
  3. Teams
  4. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more about Teams
daveagp's user avatar
daveagp's user avatar
daveagp's user avatar
daveagp
  • Member for 12 years, 9 months
  • Last seen more than 4 years ago
  • GitHub
  • ints.io/daveagp
  • Los Angeles, CA, United States
  • Meta user
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bounties
  • Reputation
  • All actions

7 Answers

Score Activity Newest
8 votes
Accepted

Estimating VC-Dimension

  • reference-request
  • approximation-algorithms
  • cg.comp-geom
  • lg.learning
  • vc-dimension
answered Feb 24, 2011 at 14:28
7 votes

Bounded-cardinality bounded-frequency set cover: hardness of approximation

  • cc.complexity-theory
  • reference-request
  • approximation-algorithms
  • set-cover
  • np-hardness
answered Aug 31, 2010 at 18:02
6 votes

The importance of Integrality Gap

  • cc.complexity-theory
  • ds.algorithms
  • approximation-algorithms
  • linear-programming
  • integrality-gap
answered Sep 23, 2010 at 10:24
3 votes

Positive topological ordering, take 3

  • ds.algorithms
  • np-hardness
  • matrices
  • open-problem
  • topological-sorting
answered Oct 5, 2010 at 18:21
2 votes

Is a k-connected graph also k-1 connected?

  • graph-theory
answered Nov 22, 2017 at 1:54
1 vote

Known sparse integer programming problems

  • ds.algorithms
  • reference-request
  • linear-programming
  • integer-programming
answered Dec 2, 2012 at 5:01
-1 votes

Journals with quick reviewing

  • soft-question
  • research-practice
  • paper-review
  • journals
answered Sep 27, 2011 at 23:08
Theoretical Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2023.5.26.43462

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.