Closed nimisha-yadav closed 3 years ago
/assign
This issue has been assigned to @arsheelsheikh! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.
The assigned contributor has more than 3 open issues, kindly reassign manually (@Supervisors/Mentors)
can i work on this issue ? Aryan Mohanty Batch -6
/assign
This issue has been assigned to @AkritiAgarwal09! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.
The assigned contributor has more than 3 open issues, kindly reassign manually (@Supervisors/Mentors)
/assign
This issue has been assigned to @Ayushi2811! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.
can i work on this issue ? Aryan Mohanty Batch -6
Assigning this issue to you @Aryan-Mohanty, all the best!
can I work on this issue? Dhruti Gandhi Batch -2
can I work on this kalyani rajebhosale mode:-documentation batch:-1
can I work on this kalyani rajebhosale mode:-documentation batch:-1
Assigning this issue to you @kalyanirb12, all the best.
@nimisha-yadav thanku
mai i work on this issue? Nikki Priya Batch-2
Can I work on it? Name-Tanvi Deshmukh batch-5 Contribution type: documentation
can I work on this kalyani rajebhosale mode:-documentation batch:-1
any updates? @kalyanirb12
@nimisha-yadav currently working on it I will update you within 2 days.
@nimisha-yadav can you Please guide me on what to do after creating documentation on this topic?
can I work on this issue? Dhruti Gandhi Batch -2
Assigning this issue to you @dhruti29
Description
Briefly explain the examples of approximation algorithms. Vertex cover problem, Travelling salesman problem, Set covering problem.
Task
Note
DSA/directory
&DSA
branch.