ST: Advanced Algorithms for Graphs and Networks - CS 6/79995

(Research oriented Course)

Spring 2013

TR :30 pm - 6:45 pm

MSB 104

Instructor
Office Hours   
   
Email 
Telephone

Dr. Feodor Dragan 
Room 254 MSB
TR 3:00 - 5:00 pm

and by appointment 
dragan at cs kent edu
(330)  672-9058

  • Outline:  The course will focus on advanced algorithms for practical problems arising in Communication Networks and Analysis of Data. This is a graduate level and research oriented course.
  • Course Content:  We will have discussions on some of the following topics and more.
    • Location problems: centers, medians, centroids, diameter, p-centers, r-domination, p-medians
    • Labeling schemes: NCA-queries, adjacency, connectivity, reachability, distance, routing
    • Network design: minimum spanning trees, diameter-bounded minimum spanning trees, light approximate shortest path trees, Steiner trees, optimal communication spanning trees
    • Tree covers and spanners, tree spanners, collective tree spanners, flow spanners
    • Embeddings of graph metrics into metrics of simple graphs
    • Navigating in a graph: Message routing, hierarchical cluster-based routing, interval routing, labeling routing schemes, routing in mobile ad-hoc networks, pseudo coordinates, navigating with aid
    • Balanced separators of graphs and their use.
  • Prerequisites
    CS 4/56101 (Design and Analysis of Algorithms).
  • Class materials
    • Lecture notes
    • A number of recent journal and conference papers.
  • Supplementary Texts
    • D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications, 2000.
    • J. Spinrad, Efficient Graph Representations, Fields Institute Monographs, 19, 2003.
    • B.Y. Wu and K.-M. Chao, Spanning Trees and Optimization Problems, CRC Press, 2003
    • J. Cheriyan and R. Ravi,  Approximation Algorithms for Networks Problems, http://www.gsia.cmu.edu/afs/andrew/gsia/ravi/WWW/new-lecnotes.html
    • D. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems, PWS Publ.Co. 1995
    • T. H. Cormen, C. E. Leiserson, R. L. Rivest   and C. Stein,  Introduction to Algorithms, MIT Press, 2001 (2nd edition)
  • Course Requirements: Research projects, presentations, research discussions and final exam-quiz. 

Active class participation

-

10%

Research projects and discussions 

-

-

-

25%

Presentations

-

-

-

25%

Final Exam

Tuesday

May 7, 2013

5:45 pm - 8:00 pm

40%

  • Registration Requirement: The official registration deadline for this course is January 27, 2013. University policy requires all students to be officially registered in each class they are attending. Students who are not officially registered for a course by published deadlines should not be attending classes and will not receive credit or a grade for the course. Each student must confirm enrollment by checking his/her class schedule (using Student Tools in FlashFast) prior to the deadline indicated. Registration errors must be corrected prior to the deadline. The last day to withdraw is March 24, 2013.
  • Student Accessibility Policy: University Policy 3342-3-01.3 requires that students with disabilities be provided reasonable accommodations to ensure their equal access to course content. If you have a documented disability and require accommodations, please contact the instructor at the beginning of the semester to make arrangements for necessary classroom adjustments. Please note, you must first verify your eligibility for these through Student Accessibility Services (contact 330-672-3391 or visit www.kent.edu/sas for more information on registration procedures).
  • STUDENT CHEATING AND PLAGIARISM: Condensed Version [For the complete policy and procedure, go to http://www.kent.edu/policyreg/policydetails.cfm?customel_datapageid_1976529=2037779]

Cheating and plagiarism constitute fraudulent misrepresentation for which no credit can be given and for which appropriate sanctions are warranted and will be applied. The university affirms that acts of cheating and plagiarism by students constitute a subversion of the goals of the institution, have no place in the university and are serious offenses to academic goals and objectives, as well as to the rights of fellow students.

"Cheat" means to intentionally misrepresent the source, nature, or other conditions of academic work so as to accrue undeserved credit, or to cooperate with someone else in such misrepresentation. Cheating includes, but is not limited to:

1.       Obtaining or retaining partial or whole copies of examinations, tests or quizzes before these are distributed for student use;

2.       Using notes, textbooks or other information in examinations, tests and quizzes, except as expressly permitted;

3.       Obtaining confidential information about examinations, tests or quizzes other than that released by the instructor;

4.       Securing, giving or exchanging information during examinations;

5.       Presenting data or other material gathered by another person or group as one's own;

6.       Falsifying experimental data or information;

7.       Having another person take one's place for any academic performance without the specific knowledge and permission of the instructor;

8.       Cooperating with another to do one or more of the above;

9.       Using a substantial portion of a piece of work previously submitted for another course or program to meet the requirements of the present course or program without notifying the instructor to whom the work is presented; and

10.    Presenting falsified information in order to postpone or avoid examinations, tests, quizzes, or other academic work.

 

"Plagiarize" means to take and present as one's own a material portion of the ideas or words of another or to present as one's own an idea or work derived from an existing source without full and proper credit to the source of the ideas, words, or works. As defined, plagiarize includes, but is not limited to:

 

a.       The copying of words, sentences and paragraphs directly from the work of another without proper credit;

b.       The copying of illustrations, figures, photographs, drawings, models, or other visual and nonverbal materials, including recordings of another without proper credit; and

c.        The presentation of work prepared by another in final or draft form as one's own without citing the source, such as the use of purchased research papers.

 

Academic Sanctions, From Section D The following academic sanctions are provided by this rule for offenses of cheating or plagiarism. Kent campus instructors shall notify the department chairperson and the student conduct office each time a sanction is imposed. Regional campus instructors shall notify the regional campus dean and the student conduct officer each time a sanction is imposed. Regional campus student conduct officer shall notify the Kent student conduct office each time a sanction is imposed by a regional campus Instructor. The following academic sanctions are provided by this rule for offenses of cheating or plagiarism. In those cases the instructor may:

 

1.       Refuse to accept the work for credit; or

2.       Assign a grade of "F" or zero for the project, test, paper, examination or other work in which the cheating or plagiarism took place; or

3.       Assign a grade of "F" for the course in which the cheating or plagiarism took place; and/or;

4.       Recommend to the department chair or regional campus dean that further action specified in the rule be taken. The department chairperson or regional campus dean shall determine whether or not to forward to the academic dean or to the vice president for the extended university a recommendation for further sanction under this rule.

 

Procedures for invoking sanctions. (From Section E)

 

(1)            Academic administrative procedures pertaining to paragraph (D)(1)(a) of this rule. In the event that an instructor determines that it is more probable than not that a student in a course or program under the instructor's supervision has presented work for university credit which involves an act of cheating, plagiarism or cooperation in either, then the instructor shall:

 

(a)            Inform the student as soon as is practical, in person or by mail, of the belief that an act of cheating or plagiarism has occurred. If the student cannot be reached in a reasonable period of time, the instructor may proceed with sanctions, notifying the student in writing as promptly as possible of the belief and the procedural steps the instructor has taken.

(b)            Provide the student an opportunity to explain orally, in writing, or both, why the student believes the evaluation of the facts is erroneous.  

(c)            If the explanation is deemed by the instructor to be inadequate or if no explanation is offered, the instructor may impose one of the academic sanctions listed in paragraph (D)(1)(a) of this rule. Where appropriate, the instructor may recommend the imposition of academic sanctions listed in paragraph (D)(1)(b) of this rule. In addition, the instructor may refer the matter to the dean of the college, campus, or school in which the student is enrolled for imposition of academic sanctions listed in paragraph (D)(1)(b) of this rule.  

(d)            The instructor shall notify the office of judicial affairs of the circumstances and action taken. Such notification will be used as background information in the event that formal conduct charges are initiated against the student.  

(e)            The instructor shall inform the student in writing of the right to appeal, and the procedure to follow.  

(f)             The instructor shall keep the evidence of cheating or plagiarism in a secure place and provide it upon request to any appeals officer or the conduct officer. The instructor shall provide copies on request to the student at the student's expense.  

(g)            The instructor shall cooperate with academic and student conduct personnel in any appeal of the decision, and/or in adjudication of any disciplinary proceedings.



F. Dragan
dragan at cs.kent.edu
Spring 2013

 


NOTICE OF MY COPYRIGHT AND INTELLECTUAL PROPERTY RIGHTS. Any intellectual property displayed or distributed to students during this course (including but not limited to powerpoint presentations, notes, quizzes, examinations) by the professor remains the intellectual property of the professor. This means that the student may not distribute, publish or provide such intellectual property to any other person or entity for any reason, commercial or otherwise, without the express written permission of the professor.