Fnd2012 Open Problems
Login
Register
Questions
Unanswered
Users
Recent
Hot!
Most votes
Most answers
Most views
Welcome to Fnd2012 Open Problems, where you can ask questions and receive answers from other members of the community.
Recent questions
Recent questions
0
votes
0
answers
Approximating Star Cover Problems
asked
Aug 1, 2012
by
ravi
(
120
points)
0
votes
0
answers
Can one improve approximation algorithms for union and intersection covering problems?
asked
Jul 31, 2012
by
sank
(
180
points)
0
votes
1
answer
How to remove Steiner points from planar metrics?
asked
Jul 31, 2012
by
anupam
(
120
points)
0
votes
0
answers
Does there exists a dual combinatorial interpretation of the matching problem in planar graphs?
asked
Jul 31, 2012
by
sank
(
180
points)
Help get things started by
asking a question
.