Exercises
Multiple Choice
Articles
Open Problems
Login
4 items
Topic:
Approximation Algorithms
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Graduate
By
Shiva Kintali
on June 17, 2012 | Updated Dec. 6, 2017
Vertex cover using DFS
Consider the following algorithm for Vertex Cover of a graph \(G\) : Run depth first search (DFS) on \(G\). Output the vertices which are not leaves in the DFS tree. Prove the following : The ou…
Computer Science
Mathematics
Approximation Algorithms
Graph Theory
vertex cover
0
Graduate
By
Shiva Kintali
on June 8, 2012 | Updated Dec. 6, 2017
Approximating (1,2)-TSP
Let \(G\) be a complete directed graph i.e., if \(u\) and \(v\) are vertices of \(G\) then both the directed edges \((u,v)\) and \((v,u)\) are present. \((1,2)\)-graphs are complete directed graphs wi…
Computer Science
Approximation Algorithms
traveling salesman
0
Graduate
By
Shiva Kintali
on July 3, 2012 | Updated Dec. 6, 2017
Minimum makespan problem
Minimum makespan scheduling problem : You are given \(n\) jobs and \(m\) identical machines. You are given processing times (say \(t_i\)) for the \(n\) jobs. Your goal is to find an assignment of the …
Computer Science
Approximation Algorithms
scheduling
0
Graduate
By
Shiva Kintali
on June 17, 2012 | Updated Dec. 6, 2017
SONET ring loading
Consider a telephone network that consists of a cycle on \(n\) nodes, numbered \(0\) through \(n-1\) clockwise around the cycle. Let \(S\) be a set of calls. Each call is a pair \((i,j)\) originating …
Computer Science
Approximation Algorithms
networks
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
trees
dynamic programming
polynomials
infinite series
counting
complete graph
crossing number
planar graphs
extremal graph theory
graph cut
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×